./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 279fae57395782089eff32ec1396d1726d808c7f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:58:22,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:58:22,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:58:23,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:58:23,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:58:23,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:58:23,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:58:23,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:58:23,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:58:23,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:58:23,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:58:23,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:58:23,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:58:23,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:58:23,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:58:23,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:58:23,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:58:23,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:58:23,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:58:23,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:58:23,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:58:23,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:58:23,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:58:23,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:58:23,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:58:23,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:58:23,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:58:23,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:58:23,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:58:23,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:58:23,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:58:23,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:58:23,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:58:23,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:58:23,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:58:23,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:58:23,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:58:23,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:58:23,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:58:23,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:58:23,031 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:58:23,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:58:23,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:58:23,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:58:23,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:58:23,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:58:23,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:58:23,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:58:23,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:58:23,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:58:23,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:58:23,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:58:23,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:58:23,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:58:23,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:58:23,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:58:23,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:58:23,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:58:23,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:58:23,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:58:23,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:58:23,037 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 279fae57395782089eff32ec1396d1726d808c7f [2018-11-23 02:58:23,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:58:23,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:58:23,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:58:23,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:58:23,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:58:23,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 02:58:23,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/data/58ae1afeb/2791a3778cbc4f6e98bb6e194f3d5e79/FLAGe3665a70f [2018-11-23 02:58:23,476 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:58:23,476 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 02:58:23,481 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/data/58ae1afeb/2791a3778cbc4f6e98bb6e194f3d5e79/FLAGe3665a70f [2018-11-23 02:58:23,888 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/data/58ae1afeb/2791a3778cbc4f6e98bb6e194f3d5e79 [2018-11-23 02:58:23,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:58:23,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:58:23,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:58:23,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:58:23,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:58:23,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:23" (1/1) ... [2018-11-23 02:58:23,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:23, skipping insertion in model container [2018-11-23 02:58:23,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:23" (1/1) ... [2018-11-23 02:58:23,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:58:23,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:58:24,027 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:58:24,032 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:58:24,046 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:58:24,057 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:58:24,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24 WrapperNode [2018-11-23 02:58:24,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:58:24,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:58:24,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:58:24,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:58:24,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:58:24,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:58:24,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:58:24,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:58:24,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... [2018-11-23 02:58:24,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:58:24,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:58:24,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:58:24,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:58:24,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/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 02:58:24,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:58:24,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:58:24,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:58:24,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:58:24,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:58:24,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:58:24,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:58:24,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:58:24,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:58:24,176 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 02:58:24,176 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 02:58:24,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:58:24,177 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 02:58:24,177 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 02:58:24,340 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:58:24,340 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 02:58:24,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:24 BoogieIcfgContainer [2018-11-23 02:58:24,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:58:24,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:58:24,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:58:24,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:58:24,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:58:23" (1/3) ... [2018-11-23 02:58:24,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e77f3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:24, skipping insertion in model container [2018-11-23 02:58:24,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:24" (2/3) ... [2018-11-23 02:58:24,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e77f3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:24, skipping insertion in model container [2018-11-23 02:58:24,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:24" (3/3) ... [2018-11-23 02:58:24,347 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-11-23 02:58:24,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:58:24,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:58:24,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:58:24,393 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:58:24,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:58:24,393 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:58:24,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:58:24,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:58:24,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:58:24,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:58:24,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:58:24,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:58:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 02:58:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 02:58:24,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:24,409 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:24,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:24,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2018-11-23 02:58:24,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:24,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:24,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:24,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 02:58:24,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:58:24,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/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 02:58:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 02:58:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:58:24,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:58:24,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:58:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:58:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:58:24,623 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 02:58:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:24,637 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2018-11-23 02:58:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:58:24,638 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2018-11-23 02:58:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:24,644 INFO L225 Difference]: With dead ends: 67 [2018-11-23 02:58:24,644 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:58:24,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:58:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:58:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:58:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:58:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 02:58:24,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2018-11-23 02:58:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 02:58:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:58:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 02:58:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 02:58:24,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:24,677 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:24,678 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:24,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2018-11-23 02:58:24,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,691 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:24,692 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:24,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:24,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:24,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 02:58:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:58:24,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:58:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:58:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:58:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:58:24,774 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-23 02:58:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:24,785 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 02:58:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:58:24,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-23 02:58:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:24,788 INFO L225 Difference]: With dead ends: 57 [2018-11-23 02:58:24,788 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:58:24,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:58:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:58:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 02:58:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:58:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 02:58:24,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2018-11-23 02:58:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:24,795 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 02:58:24,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:58:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 02:58:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 02:58:24,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:24,796 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:24,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:24,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2018-11-23 02:58:24,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 02:58:24,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:58:24,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:58:24,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:58:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:58:24,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:58:24,906 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 9 states. [2018-11-23 02:58:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:24,997 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2018-11-23 02:58:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:58:24,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 02:58:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:24,999 INFO L225 Difference]: With dead ends: 63 [2018-11-23 02:58:24,999 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 02:58:24,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:58:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 02:58:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2018-11-23 02:58:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:58:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-11-23 02:58:25,008 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 38 [2018-11-23 02:58:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,008 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 02:58:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:58:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-11-23 02:58:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 02:58:25,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,010 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash 699235283, now seen corresponding path program 1 times [2018-11-23 02:58:25,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,028 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,028 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:25,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:25,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:58:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:58:25,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:58:25,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:58:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:58:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:58:25,114 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 4 states. [2018-11-23 02:58:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:25,171 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-11-23 02:58:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:58:25,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 02:58:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:25,172 INFO L225 Difference]: With dead ends: 83 [2018-11-23 02:58:25,172 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:58:25,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 1 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 02:58:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:58:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 02:58:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 02:58:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-23 02:58:25,180 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 41 [2018-11-23 02:58:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,180 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 02:58:25,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:58:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-23 02:58:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 02:58:25,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,182 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1178839093, now seen corresponding path program 1 times [2018-11-23 02:58:25,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,198 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,198 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:25,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:25,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:58:25,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:58:25,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 02:58:25,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:58:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:58:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:58:25,304 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 5 states. [2018-11-23 02:58:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:25,401 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2018-11-23 02:58:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:58:25,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 02:58:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:25,402 INFO L225 Difference]: With dead ends: 85 [2018-11-23 02:58:25,402 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 02:58:25,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:58:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 02:58:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 02:58:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:58:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 02:58:25,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 43 [2018-11-23 02:58:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,411 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 02:58:25,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:58:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 02:58:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 02:58:25,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,413 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,413 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1778367465, now seen corresponding path program 2 times [2018-11-23 02:58:25,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,430 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,430 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:25,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:58:25,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:58:25,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:58:25,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 02:58:25,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:58:25,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 02:58:25,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:58:25,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:58:25,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:58:25,523 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 5 states. [2018-11-23 02:58:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:25,573 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2018-11-23 02:58:25,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:58:25,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 02:58:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:25,575 INFO L225 Difference]: With dead ends: 86 [2018-11-23 02:58:25,575 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 02:58:25,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:58:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 02:58:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 02:58:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 02:58:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-11-23 02:58:25,584 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 45 [2018-11-23 02:58:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,584 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-11-23 02:58:25,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:58:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-23 02:58:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 02:58:25,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,586 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,586 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1346922871, now seen corresponding path program 1 times [2018-11-23 02:58:25,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:58:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,607 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,608 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:25,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 02:58:25,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:58:25,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:58:25,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:58:25,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:58:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:58:25,686 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 4 states. [2018-11-23 02:58:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:25,724 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-23 02:58:25,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:58:25,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-23 02:58:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:25,726 INFO L225 Difference]: With dead ends: 84 [2018-11-23 02:58:25,726 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 02:58:25,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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 02:58:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 02:58:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 02:58:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 02:58:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 02:58:25,733 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 63 [2018-11-23 02:58:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,734 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 02:58:25,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:58:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 02:58:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 02:58:25,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,735 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,735 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2018-11-23 02:58:25,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,755 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,755 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:25,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 02:58:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:58:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 02:58:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:58:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:58:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:58:25,885 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 9 states. [2018-11-23 02:58:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:25,963 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2018-11-23 02:58:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:58:25,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-23 02:58:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:25,965 INFO L225 Difference]: With dead ends: 120 [2018-11-23 02:58:25,965 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 02:58:25,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:58:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 02:58:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 02:58:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 02:58:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-11-23 02:58:25,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 65 [2018-11-23 02:58:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:25,973 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2018-11-23 02:58:25,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:58:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 02:58:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 02:58:25,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:25,974 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:25,974 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:25,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2018-11-23 02:58:25,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:25,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:25,989 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:25,989 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:25,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:26,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:58:26,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:58:26,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:58:26,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 02:58:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:58:26,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 02:58:26,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:58:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:58:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:58:26,074 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2018-11-23 02:58:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:26,137 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2018-11-23 02:58:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:58:26,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 02:58:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:26,139 INFO L225 Difference]: With dead ends: 99 [2018-11-23 02:58:26,139 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 02:58:26,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:58:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 02:58:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-23 02:58:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 02:58:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-11-23 02:58:26,144 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 67 [2018-11-23 02:58:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:26,145 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-11-23 02:58:26,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:58:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 02:58:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 02:58:26,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:26,146 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:26,146 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:26,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2018-11-23 02:58:26,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:26,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:26,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:58:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:26,155 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:26,155 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:26,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:26,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:26,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-23 02:58:26,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:58:26,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 02:58:26,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:58:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:58:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:58:26,227 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 8 states. [2018-11-23 02:58:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:26,271 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-23 02:58:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:58:26,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-11-23 02:58:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:26,273 INFO L225 Difference]: With dead ends: 94 [2018-11-23 02:58:26,273 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 02:58:26,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:58:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 02:58:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 02:58:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 02:58:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-11-23 02:58:26,285 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 73 [2018-11-23 02:58:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:26,285 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-11-23 02:58:26,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:58:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-11-23 02:58:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 02:58:26,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:26,286 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:26,287 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:26,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2018-11-23 02:58:26,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:58:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:58:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:26,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:26,295 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 02:58:26,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 02:58:26,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 02:58:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:58:26,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:58:26,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 02:58:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:58:26,446 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=6, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~0 < ~N~0); VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume true; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] RET #89#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=(- 2147483647), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 2147483647), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] RET #93#return; VAL [main_~ret~1=(- 2147483647), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=(- 2147483647), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=0, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=1, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=1, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~2 < ~N~0 - 1); VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] RET #95#return; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !false; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] ----- [2018-11-23 02:58:26,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:58:26 BoogieIcfgContainer [2018-11-23 02:58:26,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:58:26,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:58:26,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:58:26,685 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:58:26,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:24" (3/4) ... [2018-11-23 02:58:26,688 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=6, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~0 < ~N~0); VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume true; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] RET #89#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=(- 2147483647), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 2147483647), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 2147483647), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483647), ~N~0=3] [?] RET #93#return; VAL [main_~ret~1=(- 2147483647), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=(- 2147483647), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=0, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=1, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=1, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~2 < ~N~0 - 1); VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] RET #95#return; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !false; VAL [main_~i~2=2, main_~ret2~0=(- 2147483647), main_~ret5~0=0, main_~ret~1=(- 2147483647), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] 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=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483647, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-2147483647, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-2147483647, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-2147483647, ~temp~0=-2147483647] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L49] 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=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret~1=-2147483647, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-2147483647, ~ret5~0=0, ~ret~1=-2147483647, ~temp~0=0] [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] ----- [2018-11-23 02:58:27,308 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a9acaefc-ed94-4135-896b-d0eed51d7299/bin-2019/uautomizer/witness.graphml [2018-11-23 02:58:27,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:58:27,309 INFO L168 Benchmark]: Toolchain (without parser) took 3418.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 959.3 MB in the beginning and 995.3 MB in the end (delta: -36.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,310 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:58:27,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.94 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:58:27,311 INFO L168 Benchmark]: Boogie Preprocessor took 63.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,311 INFO L168 Benchmark]: RCFGBuilder took 202.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,311 INFO L168 Benchmark]: TraceAbstraction took 2343.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,312 INFO L168 Benchmark]: Witness Printer took 623.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:58:27,313 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.94 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 202.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2343.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * Witness Printer took 623.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-2147483647, cnt=1, i=3, N=3, ret=-2147483647, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-2147483647, ret=-2147483647, temp=-2147483647, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-2147483647, ret2=-2147483647, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-2147483647, ret2=-2147483647, ret5=0, temp=0, x={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. UNSAFE Result, 2.2s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 327 SDtfs, 186 SDslu, 554 SDs, 0 SdLazy, 448 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 430 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 58147 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1683 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 558/580 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...