./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.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_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc22eacddab290eba000ecad4885815ce9878ac ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:56:39,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:56:39,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:56:39,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:56:39,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:56:39,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:56:39,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:56:39,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:56:39,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:56:39,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:56:39,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:56:39,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:56:39,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:56:39,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:56:39,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:56:39,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:56:39,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:56:39,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:56:39,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:56:39,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:56:39,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:56:39,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:56:39,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:56:39,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:56:39,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:56:39,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:56:39,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:56:39,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:56:39,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:56:39,538 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:56:39,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:56:39,539 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:56:39,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:56:39,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:56:39,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:56:39,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:56:39,541 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:56:39,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:56:39,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:56:39,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:56:39,553 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:56:39,553 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:56:39,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:56:39,554 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:56:39,554 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:56:39,554 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:56:39,554 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:56:39,554 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:56:39,555 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:56:39,555 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:56:39,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:56:39,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:56:39,557 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:56:39,557 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:56:39,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:56:39,557 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:56:39,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:56:39,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:56:39,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:56:39,558 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:56:39,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:56:39,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:56:39,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:56:39,558 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:56:39,559 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan 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 -> Taipan 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 -> 3bc22eacddab290eba000ecad4885815ce9878ac [2018-11-23 06:56:39,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:56:39,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:56:39,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:56:39,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:56:39,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:56:39,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i [2018-11-23 06:56:39,663 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/data/8fc449bcc/3b3abc452f134a3caa1cc197f2e91190/FLAG963e1d140 [2018-11-23 06:56:40,022 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:56:40,023 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i [2018-11-23 06:56:40,027 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/data/8fc449bcc/3b3abc452f134a3caa1cc197f2e91190/FLAG963e1d140 [2018-11-23 06:56:40,037 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/data/8fc449bcc/3b3abc452f134a3caa1cc197f2e91190 [2018-11-23 06:56:40,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:56:40,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:56:40,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:56:40,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:56:40,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:56:40,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16069910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40, skipping insertion in model container [2018-11-23 06:56:40,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:56:40,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:56:40,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:56:40,236 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:56:40,255 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:56:40,266 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:56:40,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40 WrapperNode [2018-11-23 06:56:40,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:56:40,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:56:40,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:56:40,267 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:56:40,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:56:40,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:56:40,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:56:40,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:56:40,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... [2018-11-23 06:56:40,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:56:40,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:56:40,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:56:40,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:56:40,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/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 06:56:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:56:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:56:40,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:56:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:56:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:56:40,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:56:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:56:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:56:40,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:56:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 06:56:40,417 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 06:56:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:56:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 06:56:40,417 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 06:56:40,626 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:56:40,626 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 06:56:40,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:56:40 BoogieIcfgContainer [2018-11-23 06:56:40,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:56:40,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:56:40,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:56:40,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:56:40,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:56:40" (1/3) ... [2018-11-23 06:56:40,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1637a8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:56:40, skipping insertion in model container [2018-11-23 06:56:40,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:56:40" (2/3) ... [2018-11-23 06:56:40,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1637a8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:56:40, skipping insertion in model container [2018-11-23 06:56:40,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:56:40" (3/3) ... [2018-11-23 06:56:40,635 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum40_false-unreach-call.i [2018-11-23 06:56:40,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:56:40,653 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:56:40,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:56:40,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:56:40,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:56:40,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:56:40,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:56:40,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:56:40,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:56:40,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:56:40,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:56:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 06:56:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:56:40,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:40,733 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] [2018-11-23 06:56:40,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:40,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 06:56:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:40,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:40,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:40,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:40,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:56:40,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:40,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:40,864 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 06:56:40,867 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [55], [59], [61], [62], [68], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:40,895 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:40,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:40,988 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:40,989 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 06:56:40,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:40,995 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:41,055 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 88.89% of their original sizes. [2018-11-23 06:56:41,055 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:41,086 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-11-23 06:56:41,086 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:41,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:56:41,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:56:41,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:41,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:56:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:56:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:56:41,096 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-11-23 06:56:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:41,278 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 06:56:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:56:41,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 06:56:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:41,288 INFO L225 Difference]: With dead ends: 66 [2018-11-23 06:56:41,288 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 06:56:41,291 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 06:56:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 06:56:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:56:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 06:56:41,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 06:56:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:41,329 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 06:56:41,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:56:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 06:56:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:56:41,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:41,332 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, 1] [2018-11-23 06:56:41,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:41,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 06:56:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:41,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:41,349 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:41,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:41,350 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:41,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:41,416 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 06:56:41,416 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:41,418 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:41,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:41,471 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:41,471 INFO L272 AbstractInterpreter]: Visited 17 different actions 26 times. Merged at 2 different actions 6 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 3. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-11-23 06:56:41,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:41,477 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:41,509 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 85.4% of their original sizes. [2018-11-23 06:56:41,509 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:41,555 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-23 06:56:41,556 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:41,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:56:41,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:56:41,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:41,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:56:41,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:56:41,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:56:41,559 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 7 states. [2018-11-23 06:56:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:41,872 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 06:56:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:56:41,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-23 06:56:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:41,873 INFO L225 Difference]: With dead ends: 54 [2018-11-23 06:56:41,873 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 06:56:41,874 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:56:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 06:56:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 06:56:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:56:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 06:56:41,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2018-11-23 06:56:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:41,882 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 06:56:41,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:56:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 06:56:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 06:56:41,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:41,884 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:56:41,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:41,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2018-11-23 06:56:41,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:41,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:41,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:41,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:41,900 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:41,901 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:41,901 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/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 06:56:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:41,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:41,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 06:56:41,953 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:41,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:41,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:42,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:42,135 INFO L272 AbstractInterpreter]: Visited 21 different actions 47 times. Merged at 6 different actions 19 times. Widened at 1 different actions 1 times. Performed 219 root evaluator evaluations with a maximum evaluation depth of 10. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 06:56:42,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:42,148 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:42,210 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 84.74% of their original sizes. [2018-11-23 06:56:42,210 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:42,250 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 06:56:42,250 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:42,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:56:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:56:42,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:42,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:56:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:56:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:56:42,252 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 7 states. [2018-11-23 06:56:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:42,425 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-11-23 06:56:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:56:42,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 06:56:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:42,428 INFO L225 Difference]: With dead ends: 61 [2018-11-23 06:56:42,428 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 06:56:42,429 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:56:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 06:56:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 06:56:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:56:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 06:56:42,438 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2018-11-23 06:56:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:42,438 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 06:56:42,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:56:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 06:56:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 06:56:42,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:42,441 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 06:56:42,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:42,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 06:56:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:42,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 06:56:42,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:42,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:42,518 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 06:56:42,518 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:42,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:42,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:42,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:42,562 INFO L272 AbstractInterpreter]: Visited 28 different actions 68 times. Merged at 5 different actions 24 times. Never widened. Performed 295 root evaluator evaluations with a maximum evaluation depth of 3. Performed 295 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 06:56:42,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:42,564 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:42,613 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 83.4% of their original sizes. [2018-11-23 06:56:42,613 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:42,684 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 06:56:42,684 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:42,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:56:42,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-23 06:56:42,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:42,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:56:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:56:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:42,686 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2018-11-23 06:56:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:43,093 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2018-11-23 06:56:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:56:43,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-23 06:56:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:43,095 INFO L225 Difference]: With dead ends: 74 [2018-11-23 06:56:43,095 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 06:56:43,096 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:56:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 06:56:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-23 06:56:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 06:56:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 06:56:43,105 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 48 [2018-11-23 06:56:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:43,106 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-23 06:56:43,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:56:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 06:56:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 06:56:43,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:43,107 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 06:56:43,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:43,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2018-11-23 06:56:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:43,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:43,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 06:56:43,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:43,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:43,154 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 06:56:43,154 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:43,156 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:43,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:43,200 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:43,201 INFO L272 AbstractInterpreter]: Visited 35 different actions 91 times. Merged at 7 different actions 30 times. Never widened. Performed 386 root evaluator evaluations with a maximum evaluation depth of 3. Performed 386 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-23 06:56:43,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:43,208 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:43,243 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 81.06% of their original sizes. [2018-11-23 06:56:43,243 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:43,325 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 06:56:43,325 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:56:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-23 06:56:43,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:56:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:56:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:56:43,326 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 14 states. [2018-11-23 06:56:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:43,856 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 06:56:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 06:56:43,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-11-23 06:56:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:43,857 INFO L225 Difference]: With dead ends: 66 [2018-11-23 06:56:43,857 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 06:56:43,858 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-23 06:56:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 06:56:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-11-23 06:56:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 06:56:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 06:56:43,866 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 50 [2018-11-23 06:56:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:43,867 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 06:56:43,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:56:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 06:56:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 06:56:43,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:43,868 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 06:56:43,868 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:43,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 395797120, now seen corresponding path program 1 times [2018-11-23 06:56:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:43,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:43,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:43,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:56:43,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:43,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:43,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 06:56:43,893 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:43,894 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:43,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:44,122 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:56:44,122 INFO L272 AbstractInterpreter]: Visited 30 different actions 145 times. Merged at 14 different actions 67 times. Widened at 1 different actions 2 times. Performed 701 root evaluator evaluations with a maximum evaluation depth of 10. Performed 701 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 19 fixpoints after 7 different actions. Largest state had 23 variables. [2018-11-23 06:56:44,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:44,128 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:56:44,154 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 86.31% of their original sizes. [2018-11-23 06:56:44,154 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:56:44,198 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-23 06:56:44,199 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:56:44,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:56:44,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:56:44,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:56:44,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:56:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:56:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:56:44,200 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-11-23 06:56:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:44,325 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-23 06:56:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:56:44,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 06:56:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:44,326 INFO L225 Difference]: With dead ends: 73 [2018-11-23 06:56:44,326 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 06:56:44,327 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:56:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 06:56:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 06:56:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 06:56:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-11-23 06:56:44,335 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 51 [2018-11-23 06:56:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-11-23 06:56:44,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:56:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-11-23 06:56:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 06:56:44,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:44,337 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2018-11-23 06:56:44,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:44,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:44,337 INFO L82 PathProgramCache]: Analyzing trace with hash -515269076, now seen corresponding path program 1 times [2018-11-23 06:56:44,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:44,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:44,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:44,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:56:44,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:44,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:44,359 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 06:56:44,359 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:44,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:44,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:44,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:56:44,684 INFO L272 AbstractInterpreter]: Visited 38 different actions 251 times. Merged at 22 different actions 125 times. Widened at 2 different actions 5 times. Performed 1169 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1169 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 36 fixpoints after 11 different actions. Largest state had 25 variables. [2018-11-23 06:56:44,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:44,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:56:44,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:44,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:44,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:56:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:44,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 06:56:44,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 06:56:44,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:44,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:56:44,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:44,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:56:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:56:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:44,895 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 6 states. [2018-11-23 06:56:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:44,917 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-11-23 06:56:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:56:44,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-23 06:56:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:44,921 INFO L225 Difference]: With dead ends: 95 [2018-11-23 06:56:44,921 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 06:56:44,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 06:56:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 06:56:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 06:56:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 06:56:44,932 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-11-23 06:56:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:44,932 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 06:56:44,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:56:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 06:56:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 06:56:44,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:44,934 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-11-23 06:56:44,934 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:44,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash -871058906, now seen corresponding path program 2 times [2018-11-23 06:56:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:44,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:44,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:56:44,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:44,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:56:44,967 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:44,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:44,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:44,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:56:44,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:56:45,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:56:45,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:45,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 06:56:45,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 06:56:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:45,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 06:56:45,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:45,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:56:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:56:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:56:45,144 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-11-23 06:56:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:45,177 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-11-23 06:56:45,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:56:45,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 06:56:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:45,180 INFO L225 Difference]: With dead ends: 104 [2018-11-23 06:56:45,180 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 06:56:45,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:56:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 06:56:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 06:56:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 06:56:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-11-23 06:56:45,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 59 [2018-11-23 06:56:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:45,192 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-11-23 06:56:45,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:56:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-11-23 06:56:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 06:56:45,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:45,193 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 4, 4, 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] [2018-11-23 06:56:45,194 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:45,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1442887404, now seen corresponding path program 1 times [2018-11-23 06:56:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:45,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:45,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:45,210 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:45,210 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:45,210 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/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 06:56:45,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:45,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:45,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-11-23 06:56:45,266 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:56:45,267 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:56:45,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:56:45,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:56:45,410 INFO L272 AbstractInterpreter]: Visited 37 different actions 114 times. Merged at 9 different actions 38 times. Never widened. Performed 524 root evaluator evaluations with a maximum evaluation depth of 10. Performed 524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 12 fixpoints after 6 different actions. Largest state had 25 variables. [2018-11-23 06:56:45,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:45,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:56:45,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:45,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:45,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:45,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:56:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:45,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 06:56:45,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 06:56:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:56:45,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:56:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:56:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:45,657 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 12 states. [2018-11-23 06:56:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:45,706 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-11-23 06:56:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:56:45,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 06:56:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:45,709 INFO L225 Difference]: With dead ends: 127 [2018-11-23 06:56:45,709 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 06:56:45,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 06:56:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 06:56:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 06:56:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-23 06:56:45,718 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 101 [2018-11-23 06:56:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:45,718 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-23 06:56:45,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:56:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-23 06:56:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 06:56:45,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:45,720 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 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] [2018-11-23 06:56:45,720 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:45,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -992722080, now seen corresponding path program 2 times [2018-11-23 06:56:45,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:45,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:45,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:45,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:45,734 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/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 06:56:45,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:45,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:45,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:45,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:45,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:45,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:45,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:56:45,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:56:45,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:56:45,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:45,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 06:56:45,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-11-23 06:56:45,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:45,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:56:45,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:45,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:56:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:56:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:45,960 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2018-11-23 06:56:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:45,987 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-11-23 06:56:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:56:45,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-23 06:56:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:45,989 INFO L225 Difference]: With dead ends: 123 [2018-11-23 06:56:45,989 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 06:56:45,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 06:56:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 06:56:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 06:56:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-11-23 06:56:46,001 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 113 [2018-11-23 06:56:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:46,001 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-11-23 06:56:46,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:56:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-11-23 06:56:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 06:56:46,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:46,002 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 4, 4, 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] [2018-11-23 06:56:46,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:46,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:46,003 INFO L82 PathProgramCache]: Analyzing trace with hash -748407238, now seen corresponding path program 3 times [2018-11-23 06:56:46,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:46,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:46,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:46,019 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:46,019 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:46,020 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/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 06:56:46,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:46,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:46,092 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:46,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:46,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:46,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:46,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:56:46,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:56:46,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:56:46,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:46,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 06:56:46,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 06:56:46,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:46,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 06:56:46,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:46,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 06:56:46,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 06:56:46,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 06:56:46,389 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 24 states. [2018-11-23 06:56:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:46,447 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-11-23 06:56:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 06:56:46,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2018-11-23 06:56:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:46,449 INFO L225 Difference]: With dead ends: 175 [2018-11-23 06:56:46,449 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 06:56:46,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 06:56:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 06:56:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 06:56:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 06:56:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-11-23 06:56:46,462 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 119 [2018-11-23 06:56:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:46,462 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-11-23 06:56:46,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 06:56:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-11-23 06:56:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 06:56:46,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:46,465 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 18, 18, 15, 4, 4, 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] [2018-11-23 06:56:46,466 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:46,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1957844770, now seen corresponding path program 4 times [2018-11-23 06:56:46,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:46,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:46,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:46,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:46,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:46,485 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:46,486 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:46,486 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:46,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:46,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:46,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:46,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:46,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:46,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:46,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:56:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:46,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 06:56:46,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 06:56:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2018-11-23 06:56:47,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:47,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 06:56:47,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 06:56:47,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 06:56:47,218 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 42 states. [2018-11-23 06:56:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:47,298 INFO L93 Difference]: Finished difference Result 211 states and 260 transitions. [2018-11-23 06:56:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 06:56:47,299 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 143 [2018-11-23 06:56:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:47,300 INFO L225 Difference]: With dead ends: 211 [2018-11-23 06:56:47,300 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 06:56:47,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 06:56:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 06:56:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-23 06:56:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 06:56:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-11-23 06:56:47,311 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 143 [2018-11-23 06:56:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:47,312 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-11-23 06:56:47,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 06:56:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-11-23 06:56:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 06:56:47,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:47,314 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 18, 18, 15, 4, 4, 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] [2018-11-23 06:56:47,314 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:47,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1294803074, now seen corresponding path program 5 times [2018-11-23 06:56:47,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:47,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:47,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:47,336 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:47,336 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:47,336 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:47,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:47,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:47,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:47,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:47,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:47,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:47,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:56:47,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:56:50,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 06:56:50,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:50,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2018-11-23 06:56:50,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2018-11-23 06:56:50,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:50,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:56:50,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:50,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:56:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:56:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:50,191 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 6 states. [2018-11-23 06:56:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:50,210 INFO L93 Difference]: Finished difference Result 216 states and 257 transitions. [2018-11-23 06:56:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:56:50,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-11-23 06:56:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:50,212 INFO L225 Difference]: With dead ends: 216 [2018-11-23 06:56:50,212 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 06:56:50,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:56:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 06:56:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-23 06:56:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 06:56:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-11-23 06:56:50,221 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 179 [2018-11-23 06:56:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:50,221 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-11-23 06:56:50,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:56:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2018-11-23 06:56:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-23 06:56:50,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:50,223 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 27, 27, 15, 12, 4, 4, 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] [2018-11-23 06:56:50,224 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:50,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1305528874, now seen corresponding path program 6 times [2018-11-23 06:56:50,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:50,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:50,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:50,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:50,246 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:50,246 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:50,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:50,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:50,311 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:50,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:50,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:56:50,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:56:50,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:56:50,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:50,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 728 proven. 26 refuted. 0 times theorem prover too weak. 2011 trivial. 0 not checked. [2018-11-23 06:56:50,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 330 proven. 291 refuted. 0 times theorem prover too weak. 2144 trivial. 0 not checked. [2018-11-23 06:56:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:50,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:56:50,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:50,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:56:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:56:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:50,487 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 12 states. [2018-11-23 06:56:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:50,512 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2018-11-23 06:56:50,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:56:50,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2018-11-23 06:56:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:50,514 INFO L225 Difference]: With dead ends: 243 [2018-11-23 06:56:50,514 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 06:56:50,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 06:56:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-23 06:56:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 06:56:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-11-23 06:56:50,523 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 206 [2018-11-23 06:56:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:50,523 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-11-23 06:56:50,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:56:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-11-23 06:56:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-23 06:56:50,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:50,525 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 40, 40, 30, 15, 4, 4, 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] [2018-11-23 06:56:50,525 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:50,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1882242006, now seen corresponding path program 7 times [2018-11-23 06:56:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:50,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:50,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:50,545 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:50,545 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:50,546 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:50,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:50,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:50,627 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:50,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:50,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:50,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:50,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:50,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:56:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:50,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 1133 proven. 155 refuted. 0 times theorem prover too weak. 3448 trivial. 0 not checked. [2018-11-23 06:56:50,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 149 proven. 1573 refuted. 0 times theorem prover too weak. 3014 trivial. 0 not checked. [2018-11-23 06:56:50,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:50,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-23 06:56:50,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:50,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 06:56:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 06:56:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 06:56:50,928 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 23 states. [2018-11-23 06:56:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:50,977 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2018-11-23 06:56:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 06:56:50,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 260 [2018-11-23 06:56:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:50,978 INFO L225 Difference]: With dead ends: 294 [2018-11-23 06:56:50,978 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 06:56:50,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 06:56:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 06:56:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-23 06:56:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 06:56:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 226 transitions. [2018-11-23 06:56:51,000 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 226 transitions. Word has length 260 [2018-11-23 06:56:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:51,000 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 226 transitions. [2018-11-23 06:56:51,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 06:56:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 226 transitions. [2018-11-23 06:56:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-23 06:56:51,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:51,006 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 63, 40, 40, 15, 4, 4, 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] [2018-11-23 06:56:51,006 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:51,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -216821890, now seen corresponding path program 8 times [2018-11-23 06:56:51,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:51,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:51,027 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:51,027 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:51,028 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:51,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:51,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:51,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:51,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:51,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:51,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:56:51,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:56:51,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 06:56:51,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:51,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10874 backedges. 4170 proven. 16 refuted. 0 times theorem prover too weak. 6688 trivial. 0 not checked. [2018-11-23 06:56:51,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10874 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10858 trivial. 0 not checked. [2018-11-23 06:56:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:51,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:56:51,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:56:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:56:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:51,301 INFO L87 Difference]: Start difference. First operand 210 states and 226 transitions. Second operand 12 states. [2018-11-23 06:56:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:51,331 INFO L93 Difference]: Finished difference Result 327 states and 362 transitions. [2018-11-23 06:56:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:56:51,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 359 [2018-11-23 06:56:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:51,333 INFO L225 Difference]: With dead ends: 327 [2018-11-23 06:56:51,333 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 06:56:51,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:56:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 06:56:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-11-23 06:56:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-23 06:56:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 250 transitions. [2018-11-23 06:56:51,345 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 250 transitions. Word has length 359 [2018-11-23 06:56:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:51,346 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 250 transitions. [2018-11-23 06:56:51,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:56:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 250 transitions. [2018-11-23 06:56:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-23 06:56:51,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:51,348 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 63, 40, 40, 15, 10, 10, 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] [2018-11-23 06:56:51,349 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:51,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash -437205326, now seen corresponding path program 9 times [2018-11-23 06:56:51,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:51,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:51,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:51,371 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:51,371 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:51,371 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:51,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:51,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:51,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:51,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:51,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:51,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:51,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:56:51,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:56:51,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:56:51,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:56:51,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10958 backedges. 6251 proven. 1001 refuted. 0 times theorem prover too weak. 3706 trivial. 0 not checked. [2018-11-23 06:56:51,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10958 backedges. 2084 proven. 3085 refuted. 0 times theorem prover too weak. 5789 trivial. 0 not checked. [2018-11-23 06:56:52,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:52,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2018-11-23 06:56:52,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:52,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 06:56:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 06:56:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 06:56:52,295 INFO L87 Difference]: Start difference. First operand 234 states and 250 transitions. Second operand 42 states. [2018-11-23 06:56:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:52,418 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2018-11-23 06:56:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 06:56:52,420 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 371 [2018-11-23 06:56:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:52,421 INFO L225 Difference]: With dead ends: 417 [2018-11-23 06:56:52,421 INFO L226 Difference]: Without dead ends: 276 [2018-11-23 06:56:52,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 687 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 06:56:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-23 06:56:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-11-23 06:56:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-23 06:56:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 306 transitions. [2018-11-23 06:56:52,438 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 306 transitions. Word has length 371 [2018-11-23 06:56:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:52,439 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 306 transitions. [2018-11-23 06:56:52,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 06:56:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 306 transitions. [2018-11-23 06:56:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-11-23 06:56:52,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:52,442 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 10, 10, 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] [2018-11-23 06:56:52,442 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:52,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2041066766, now seen corresponding path program 10 times [2018-11-23 06:56:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:52,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:52,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:52,467 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:52,467 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:52,468 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:52,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:52,559 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:52,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:52,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:52,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:52,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:52,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:56:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:52,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:56:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23495 backedges. 9770 proven. 100 refuted. 0 times theorem prover too weak. 13625 trivial. 0 not checked. [2018-11-23 06:56:52,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:56:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23495 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 23395 trivial. 0 not checked. [2018-11-23 06:56:53,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:56:53,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 06:56:53,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:56:53,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 06:56:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 06:56:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 06:56:53,007 INFO L87 Difference]: Start difference. First operand 276 states and 306 transitions. Second operand 24 states. [2018-11-23 06:56:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:56:53,066 INFO L93 Difference]: Finished difference Result 459 states and 534 transitions. [2018-11-23 06:56:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 06:56:53,067 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 497 [2018-11-23 06:56:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:56:53,068 INFO L225 Difference]: With dead ends: 459 [2018-11-23 06:56:53,068 INFO L226 Difference]: Without dead ends: 324 [2018-11-23 06:56:53,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 06:56:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-23 06:56:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-11-23 06:56:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-23 06:56:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 354 transitions. [2018-11-23 06:56:53,082 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 354 transitions. Word has length 497 [2018-11-23 06:56:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:56:53,083 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 354 transitions. [2018-11-23 06:56:53,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 06:56:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 354 transitions. [2018-11-23 06:56:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-11-23 06:56:53,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:56:53,086 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 22, 22, 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] [2018-11-23 06:56:53,086 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:56:53,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:56:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash -347787942, now seen corresponding path program 11 times [2018-11-23 06:56:53,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:56:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:56:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:56:53,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:56:53,104 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:56:53,104 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:56:53,105 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:56:53,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:56:53,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:56:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:56:53,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:56:53,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:56:53,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:56:53,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:56:53,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:56:53,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:57:21,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-23 06:57:21,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:57:21,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:57:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 23879 backedges. 9770 proven. 484 refuted. 0 times theorem prover too weak. 13625 trivial. 0 not checked. [2018-11-23 06:57:21,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:57:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23879 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 23395 trivial. 0 not checked. [2018-11-23 06:57:22,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:57:22,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 41 [2018-11-23 06:57:22,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:57:22,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 06:57:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 06:57:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 06:57:22,486 INFO L87 Difference]: Start difference. First operand 324 states and 354 transitions. Second operand 41 states. [2018-11-23 06:57:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:57:22,596 INFO L93 Difference]: Finished difference Result 527 states and 612 transitions. [2018-11-23 06:57:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 06:57:22,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 521 [2018-11-23 06:57:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:57:22,600 INFO L225 Difference]: With dead ends: 527 [2018-11-23 06:57:22,600 INFO L226 Difference]: Without dead ends: 392 [2018-11-23 06:57:22,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 995 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 06:57:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-23 06:57:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-11-23 06:57:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 06:57:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 422 transitions. [2018-11-23 06:57:22,623 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 422 transitions. Word has length 521 [2018-11-23 06:57:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:57:22,623 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 422 transitions. [2018-11-23 06:57:22,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 06:57:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 422 transitions. [2018-11-23 06:57:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-11-23 06:57:22,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:57:22,627 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 39, 39, 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] [2018-11-23 06:57:22,627 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:57:22,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:57:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1510047400, now seen corresponding path program 12 times [2018-11-23 06:57:22,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:57:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:57:22,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:57:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:57:22,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:57:22,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:57:22,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:57:22,649 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cbf8d6a-7d1d-461b-80cc-7fa8cacd0cea/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:57:22,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:57:22,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:57:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 06:57:24,762 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-11-23 06:57:24,763 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] assume true; [?] RET #78#return; [?] CALL call #t~ret12 := main(); [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160); [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 40);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !(~i~0 < 40); [?] assume true; [?] RET #82#return; [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 40); [?] 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); [?] assume true; [?] RET #84#return; [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 40); [?] 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); [?] assume true; [?] RET #86#return; [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 39);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !(~i~2 < 39); [?] call write~int(~temp~0, ~#x~0.base, 156 + ~#x~0.offset, 4); [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume !(~i~1 > 20); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 40); [?] assume ~i~1 > 20;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 40); [?] 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); [?] assume true; [?] RET #88#return; [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [?] assume !false; [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 40); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 39); [L46] call write~int(~temp~0, ~#x~0.base, 156 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 40); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 40); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 39); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 39); [L46] call write~int(~temp~0, ~#x~0.base, 156 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume !(~i~1 > 20); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 40); [L18-L21] assume ~i~1 > 20; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 40); [L23-L26] assume 0 != ~cnt~0; [L24] #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); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 40) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 39) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 156 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 40) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 39) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 156 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 40) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 39) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 156 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(160); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 40)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 40) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 39)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 39) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 156 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND FALSE !(~i~1 > 20) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 40)) [L18] COND TRUE ~i~1 > 20 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 40) [L23] COND TRUE 0 != ~cnt~0 [L24] #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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [L31] int x[40]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 40) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<40 -1) [L46] x[40 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() ----- [2018-11-23 06:57:28,416 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-11-23 06:57:28,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:57:28 BoogieIcfgContainer [2018-11-23 06:57:28,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:57:28,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:57:28,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:57:28,417 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:57:28,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:56:40" (3/4) ... [2018-11-23 06:57:28,422 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:57:28,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:57:28,423 INFO L168 Benchmark]: Toolchain (without parser) took 48382.61 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 617.1 MB). Free memory was 953.8 MB in the beginning and 1.3 GB in the end (delta: -395.5 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:57:28,424 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:57:28,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:57:28,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:57:28,425 INFO L168 Benchmark]: Boogie Preprocessor took 73.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -251.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:57:28,425 INFO L168 Benchmark]: RCFGBuilder took 259.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:57:28,426 INFO L168 Benchmark]: TraceAbstraction took 47788.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 421.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -177.6 MB). Peak memory consumption was 243.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:57:28,426 INFO L168 Benchmark]: Witness Printer took 5.84 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:57:28,428 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -251.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47788.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 421.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -177.6 MB). Peak memory consumption was 243.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.84 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 50]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L31] int x[40]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 40) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<40 -1) [L46] x[40 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNKNOWN Result, 47.7s OverallTime, 20 OverallIterations, 120 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 601 SDslu, 1781 SDs, 0 SdLazy, 620 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 6236 GetRequests, 5920 SyntacticMatches, 28 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.8930923737103509 AbsIntWeakeningRatio, 1.1797752808988764 AbsIntAvgWeakeningVarsNumRemoved, 3.3895131086142323 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 33.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 6790 NumberOfCodeBlocks, 6054 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 6032 ConstructedInterpolants, 0 QuantifiedInterpolants, 2330398 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5747 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 28 InterpolantComputations, 0 PerfectInterpolantSequences, 155114/163681 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...