java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum05_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:13:13,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:13:13,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:13:13,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:13:13,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:13:13,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:13:13,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:13:13,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:13:13,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:13:13,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:13:13,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:13:13,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:13:13,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:13:13,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:13:13,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:13:13,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:13:13,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:13:13,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:13:13,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:13:13,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:13:13,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:13:13,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:13:13,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:13:13,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:13:13,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:13:13,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:13:13,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:13:13,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:13:13,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:13:13,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:13:13,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:13:13,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:13:13,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:13:13,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:13:13,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:13:13,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:13:13,387 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:13:13,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:13:13,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:13:13,409 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:13:13,410 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:13:13,410 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:13:13,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:13:13,411 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:13:13,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:13:13,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:13:13,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:13:13,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:13:13,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:13:13,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:13:13,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:13:13,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:13:13,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:13:13,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:13:13,413 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:13:13,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:13:13,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:13:13,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:13:13,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:13:13,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:13:13,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:13,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:13:13,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:13:13,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:13:13,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:13:13,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:13:13,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:13:13,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:13:13,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:13:13,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:13:13,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:13:13,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:13:13,501 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:13:13,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-23 12:13:13,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce58e1f97/4f20c5283233440da8e770ca22cbe5b7/FLAG5f06de2aa [2018-11-23 12:13:14,039 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:13:14,040 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-23 12:13:14,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce58e1f97/4f20c5283233440da8e770ca22cbe5b7/FLAG5f06de2aa [2018-11-23 12:13:14,385 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce58e1f97/4f20c5283233440da8e770ca22cbe5b7 [2018-11-23 12:13:14,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:13:14,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:13:14,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:14,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:13:14,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:13:14,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c57ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14, skipping insertion in model container [2018-11-23 12:13:14,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:13:14,450 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:13:14,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:14,718 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:13:14,748 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:14,766 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:13:14,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14 WrapperNode [2018-11-23 12:13:14,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:14,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:14,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:13:14,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:13:14,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:14,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:13:14,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:13:14,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:13:14,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... [2018-11-23 12:13:14,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:13:14,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:13:14,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:13:14,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:13:14,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:13:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:13:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:13:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:13:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:13:14,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:13:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:13:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:13:14,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:13:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 12:13:14,968 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 12:13:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:13:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 12:13:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 12:13:15,882 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:13:15,882 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:13:15,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:15 BoogieIcfgContainer [2018-11-23 12:13:15,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:13:15,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:13:15,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:13:15,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:13:15,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:13:14" (1/3) ... [2018-11-23 12:13:15,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364a8612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:15, skipping insertion in model container [2018-11-23 12:13:15,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:14" (2/3) ... [2018-11-23 12:13:15,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364a8612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:15, skipping insertion in model container [2018-11-23 12:13:15,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:15" (3/3) ... [2018-11-23 12:13:15,890 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-11-23 12:13:15,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:13:15,905 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:13:15,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:13:15,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:13:15,963 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:13:15,963 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:13:15,963 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:13:15,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:13:15,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:13:15,964 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:13:15,964 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:13:15,964 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:13:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 12:13:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:15,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:15,993 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 12:13:15,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:16,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 12:13:16,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:16,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:16,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:16,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:16,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:16,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 12:13:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:16,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:13:16,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:16,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:16,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 12:13:16,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 12:13:16,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:16,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2018-11-23 12:13:16,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2018-11-23 12:13:16,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {40#true} is VALID [2018-11-23 12:13:16,385 INFO L256 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:16,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {40#true} is VALID [2018-11-23 12:13:16,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 5); {40#true} is VALID [2018-11-23 12:13:16,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:16,386 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2018-11-23 12:13:16,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {40#true} is VALID [2018-11-23 12:13:16,387 INFO L256 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:16,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#true} ~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; {40#true} is VALID [2018-11-23 12:13:16,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 12:13:16,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} 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); {41#false} is VALID [2018-11-23 12:13:16,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:16,389 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2018-11-23 12:13:16,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {41#false} 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); {41#false} is VALID [2018-11-23 12:13:16,390 INFO L256 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:16,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {41#false} ~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; {41#false} is VALID [2018-11-23 12:13:16,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:16,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {41#false} 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); {41#false} is VALID [2018-11-23 12:13:16,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:16,391 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2018-11-23 12:13:16,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {41#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {41#false} is VALID [2018-11-23 12:13:16,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 4); {41#false} is VALID [2018-11-23 12:13:16,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {41#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {41#false} is VALID [2018-11-23 12:13:16,392 INFO L256 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:16,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {41#false} ~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; {41#false} is VALID [2018-11-23 12:13:16,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:16,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {41#false} 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); {41#false} is VALID [2018-11-23 12:13:16,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:16,394 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2018-11-23 12:13:16,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {41#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {41#false} is VALID [2018-11-23 12:13:16,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2018-11-23 12:13:16,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 12:13:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:13:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:16,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:13:16,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:16,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:16,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:13:16,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:16,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:13:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:13:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:16,650 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 12:13:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:16,790 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-23 12:13:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:13:16,791 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:16,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2018-11-23 12:13:17,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:17,509 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:13:17,509 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:13:17,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:13:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:13:17,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:17,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:17,715 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:17,715 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:17,722 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:17,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:17,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:17,724 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:17,725 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:17,731 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:17,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:17,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:17,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:17,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:13:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:13:17,739 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2018-11-23 12:13:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:17,739 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:13:17,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:13:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:17,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:17,742 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 12:13:17,742 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:17,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2018-11-23 12:13:17,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:17,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:17,760 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:17,760 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:17,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:17,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:17,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:18,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2018-11-23 12:13:18,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {344#true} is VALID [2018-11-23 12:13:18,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2018-11-23 12:13:18,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2018-11-23 12:13:18,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2018-11-23 12:13:18,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {344#true} is VALID [2018-11-23 12:13:18,057 INFO L256 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2018-11-23 12:13:18,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {370#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:18,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 5); {345#false} is VALID [2018-11-23 12:13:18,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,063 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2018-11-23 12:13:18,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {345#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {345#false} is VALID [2018-11-23 12:13:18,063 INFO L256 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {345#false} ~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; {345#false} is VALID [2018-11-23 12:13:18,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2018-11-23 12:13:18,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {345#false} 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); {345#false} is VALID [2018-11-23 12:13:18,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,065 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2018-11-23 12:13:18,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {345#false} 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); {345#false} is VALID [2018-11-23 12:13:18,066 INFO L256 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {345#false} ~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; {345#false} is VALID [2018-11-23 12:13:18,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2018-11-23 12:13:18,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {345#false} 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); {345#false} is VALID [2018-11-23 12:13:18,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,067 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2018-11-23 12:13:18,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {345#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {345#false} is VALID [2018-11-23 12:13:18,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 4); {345#false} is VALID [2018-11-23 12:13:18,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {345#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {345#false} is VALID [2018-11-23 12:13:18,069 INFO L256 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {345#false} ~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; {345#false} is VALID [2018-11-23 12:13:18,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2018-11-23 12:13:18,070 INFO L273 TraceCheckUtils]: 31: Hoare triple {345#false} 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); {345#false} is VALID [2018-11-23 12:13:18,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,071 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2018-11-23 12:13:18,071 INFO L273 TraceCheckUtils]: 34: Hoare triple {345#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {345#false} is VALID [2018-11-23 12:13:18,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2018-11-23 12:13:18,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2018-11-23 12:13:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:13:18,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:18,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:18,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:18,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:18,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:18,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:18,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:18,222 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 12:13:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:18,600 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 12:13:18,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:18,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:18,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:18,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:18,848 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:13:18,849 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:13:18,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:13:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:13:18,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:18,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:18,886 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:18,886 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:18,889 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:18,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:18,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:18,891 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:18,891 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:18,895 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:18,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:18,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:18,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:18,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:13:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:13:18,899 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 12:13:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:18,900 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:13:18,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:13:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:18,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:18,902 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 12:13:18,902 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:18,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 12:13:18,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:18,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:18,940 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:18,941 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:18,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:18,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:19,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2018-11-23 12:13:19,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {648#true} is VALID [2018-11-23 12:13:19,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:19,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2018-11-23 12:13:19,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2018-11-23 12:13:19,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {648#true} is VALID [2018-11-23 12:13:19,099 INFO L256 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:19,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {648#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {648#true} is VALID [2018-11-23 12:13:19,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {648#true} is VALID [2018-11-23 12:13:19,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {648#true} is VALID [2018-11-23 12:13:19,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 5); {648#true} is VALID [2018-11-23 12:13:19,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:19,100 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2018-11-23 12:13:19,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {648#true} is VALID [2018-11-23 12:13:19,101 INFO L256 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:19,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {648#true} ~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; {698#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:19,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 5); {698#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:19,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {698#(= 0 rangesum_~cnt~0)} 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); {649#false} is VALID [2018-11-23 12:13:19,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,103 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2018-11-23 12:13:19,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#false} 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); {649#false} is VALID [2018-11-23 12:13:19,104 INFO L256 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:19,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {649#false} ~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; {649#false} is VALID [2018-11-23 12:13:19,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2018-11-23 12:13:19,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {649#false} 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); {649#false} is VALID [2018-11-23 12:13:19,105 INFO L273 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,106 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2018-11-23 12:13:19,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {649#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {649#false} is VALID [2018-11-23 12:13:19,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 4); {649#false} is VALID [2018-11-23 12:13:19,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {649#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {649#false} is VALID [2018-11-23 12:13:19,107 INFO L256 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:19,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {649#false} ~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; {649#false} is VALID [2018-11-23 12:13:19,107 INFO L273 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2018-11-23 12:13:19,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {649#false} 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); {649#false} is VALID [2018-11-23 12:13:19,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,108 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2018-11-23 12:13:19,108 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {649#false} is VALID [2018-11-23 12:13:19,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2018-11-23 12:13:19,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2018-11-23 12:13:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:13:19,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:19,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:19,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:19,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:19,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:19,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:19,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:19,195 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-23 12:13:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,387 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 12:13:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:19,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:19,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 12:13:19,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:19,528 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:13:19,529 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:13:19,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:13:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:13:19,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:19,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:19,560 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:19,560 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,564 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:19,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:19,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:19,565 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:19,566 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,569 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:19,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:19,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:19,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:19,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:19,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 39 [2018-11-23 12:13:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:19,574 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:19,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:19,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:19,577 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 12:13:19,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:19,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash -22870507, now seen corresponding path program 1 times [2018-11-23 12:13:19,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:19,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:19,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:19,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:19,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:19,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:19,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {974#true} is VALID [2018-11-23 12:13:19,698 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:19,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:19,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:19,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 5); {974#true} is VALID [2018-11-23 12:13:19,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,700 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:19,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:19,701 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#true} ~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; {976#(= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {976#(= rangesum_~i~1 0)} assume !(~i~1 < 5); {975#false} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:19,708 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:19,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} 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); {975#false} is VALID [2018-11-23 12:13:19,708 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {974#true} ~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; {974#true} is VALID [2018-11-23 12:13:19,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {974#true} assume !(~i~1 < 5); {974#true} is VALID [2018-11-23 12:13:19,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:19,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,711 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {974#true} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:19,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {975#false} is VALID [2018-11-23 12:13:19,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 4); {975#false} is VALID [2018-11-23 12:13:19,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:19,712 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {974#true} ~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; {974#true} is VALID [2018-11-23 12:13:19,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {974#true} assume !(~i~1 < 5); {974#true} is VALID [2018-11-23 12:13:19,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:19,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,713 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {974#true} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:19,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:19,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:19,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:13:19,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:19,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:19,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:19,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:19,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:19,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:19,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {974#true} is VALID [2018-11-23 12:13:19,919 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:19,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:19,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:19,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 5); {974#true} is VALID [2018-11-23 12:13:19,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:19,922 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:19,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:19,923 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:19,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#true} ~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; {1025#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:19,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#(<= rangesum_~i~1 0)} assume !(~i~1 < 5); {975#false} is VALID [2018-11-23 12:13:19,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:19,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:19,937 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:19,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} 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); {975#false} is VALID [2018-11-23 12:13:19,938 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:19,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#false} ~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; {975#false} is VALID [2018-11-23 12:13:19,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} assume !(~i~1 < 5); {975#false} is VALID [2018-11-23 12:13:19,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:19,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:19,939 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {975#false} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:19,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {975#false} is VALID [2018-11-23 12:13:19,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 4); {975#false} is VALID [2018-11-23 12:13:19,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:19,940 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:19,940 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} ~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; {975#false} is VALID [2018-11-23 12:13:19,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~1 < 5); {975#false} is VALID [2018-11-23 12:13:19,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:19,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:19,941 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {975#false} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:19,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:19,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:19,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:13:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:13:19,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:19,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:19,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:20,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:20,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:20,064 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,299 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 12:13:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:20,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:20,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:20,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:20,414 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:13:20,414 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:20,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:13:20,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:20,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:20,451 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:20,451 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,454 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:20,455 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:20,455 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,458 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:20,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:20,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:20,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:20,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:13:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:13:20,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 39 [2018-11-23 12:13:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:20,463 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:13:20,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:13:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:13:20,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:20,464 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 12:13:20,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:20,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 12:13:20,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:20,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:20,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:20,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:20,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:20,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {1313#true} is VALID [2018-11-23 12:13:20,562 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:20,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:20,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:20,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:20,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 5); {1313#true} is VALID [2018-11-23 12:13:20,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:20,564 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:20,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:20,564 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:20,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#true} ~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; {1313#true} is VALID [2018-11-23 12:13:20,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:20,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 2); {1315#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:20,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1316#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:20,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#(<= rangesum_~i~1 3)} assume !(~i~1 < 5); {1314#false} is VALID [2018-11-23 12:13:20,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:20,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:20,576 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1314#false} {1313#true} #84#return; {1314#false} is VALID [2018-11-23 12:13:20,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {1314#false} 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); {1314#false} is VALID [2018-11-23 12:13:20,577 INFO L256 TraceCheckUtils]: 24: Hoare triple {1314#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:20,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#true} ~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; {1313#true} is VALID [2018-11-23 12:13:20,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:20,577 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 2); {1313#true} is VALID [2018-11-23 12:13:20,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:20,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:20,578 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:20,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:20,579 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1314#false} #86#return; {1314#false} is VALID [2018-11-23 12:13:20,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {1314#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1314#false} is VALID [2018-11-23 12:13:20,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {1314#false} assume !(~i~2 < 4); {1314#false} is VALID [2018-11-23 12:13:20,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:20,580 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:20,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {1313#true} ~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; {1313#true} is VALID [2018-11-23 12:13:20,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {1313#true} assume !!(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:20,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {1313#true} assume !(~i~1 > 2); {1313#true} is VALID [2018-11-23 12:13:20,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:20,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {1313#true} assume !(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:20,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:20,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:20,582 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1313#true} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:20,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:20,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:20,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:20,586 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 12:13:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:20,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:13:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:21,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:21,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:21,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:21,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:21,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {1313#true} is VALID [2018-11-23 12:13:21,145 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:21,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:21,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:21,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 5); {1313#true} is VALID [2018-11-23 12:13:21,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,147 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:21,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:21,147 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#true} ~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; {1313#true} is VALID [2018-11-23 12:13:21,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:21,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 2); {1313#true} is VALID [2018-11-23 12:13:21,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {1313#true} assume !(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:21,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,150 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1313#true} {1313#true} #84#return; {1313#true} is VALID [2018-11-23 12:13:21,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {1313#true} 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); {1313#true} is VALID [2018-11-23 12:13:21,150 INFO L256 TraceCheckUtils]: 24: Hoare triple {1313#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#true} ~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; {1313#true} is VALID [2018-11-23 12:13:21,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:21,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 2); {1313#true} is VALID [2018-11-23 12:13:21,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 5); {1313#true} is VALID [2018-11-23 12:13:21,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,152 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1313#true} #86#return; {1313#true} is VALID [2018-11-23 12:13:21,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {1313#true} 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; {1419#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:21,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {1419#(<= main_~i~2 0)} assume !(~i~2 < 4); {1314#false} is VALID [2018-11-23 12:13:21,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:21,185 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1314#false} is VALID [2018-11-23 12:13:21,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {1314#false} ~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; {1314#false} is VALID [2018-11-23 12:13:21,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {1314#false} assume !!(~i~1 < 5); {1314#false} is VALID [2018-11-23 12:13:21,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {1314#false} assume !(~i~1 > 2); {1314#false} is VALID [2018-11-23 12:13:21,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {1314#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1314#false} is VALID [2018-11-23 12:13:21,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {1314#false} assume !(~i~1 < 5); {1314#false} is VALID [2018-11-23 12:13:21,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:21,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:21,187 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1314#false} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:21,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:21,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:21,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 12:13:21,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:21,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-23 12:13:21,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:21,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:21,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:21,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:21,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:21,379 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2018-11-23 12:13:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:21,603 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 12:13:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:21,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:21,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:13:21,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:21,741 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:21,741 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:13:21,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:13:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 12:13:21,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:21,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:21,773 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:21,774 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:21,776 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:21,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:21,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:21,777 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:21,778 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:21,781 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:21,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:21,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:21,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:21,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:13:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:13:21,785 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 48 [2018-11-23 12:13:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:21,785 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:13:21,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:13:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:13:21,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:21,787 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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 12:13:21,788 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:21,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1681907214, now seen corresponding path program 1 times [2018-11-23 12:13:21,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:21,803 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:21,803 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:21,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:21,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:22,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1697#true} is VALID [2018-11-23 12:13:22,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1697#true} is VALID [2018-11-23 12:13:22,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2018-11-23 12:13:22,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #78#return; {1697#true} is VALID [2018-11-23 12:13:22,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret12 := main(); {1697#true} is VALID [2018-11-23 12:13:22,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {1697#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {1697#true} is VALID [2018-11-23 12:13:22,198 INFO L256 TraceCheckUtils]: 6: Hoare triple {1697#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1697#true} is VALID [2018-11-23 12:13:22,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {1697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {1723#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {1723#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1730#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:22,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1730#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1698#false} is VALID [2018-11-23 12:13:22,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1698#false} {1697#true} #82#return; {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {1698#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L256 TraceCheckUtils]: 14: Hoare triple {1698#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {1698#false} ~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; {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {1698#false} assume !(~i~1 > 2); {1698#false} is VALID [2018-11-23 12:13:22,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {1698#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {1698#false} assume !(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {1698#false} 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); {1698#false} is VALID [2018-11-23 12:13:22,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,204 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1698#false} {1698#false} #84#return; {1698#false} is VALID [2018-11-23 12:13:22,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {1698#false} 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); {1698#false} is VALID [2018-11-23 12:13:22,205 INFO L256 TraceCheckUtils]: 27: Hoare triple {1698#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {1698#false} ~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; {1698#false} is VALID [2018-11-23 12:13:22,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,205 INFO L273 TraceCheckUtils]: 30: Hoare triple {1698#false} assume !(~i~1 > 2); {1698#false} is VALID [2018-11-23 12:13:22,206 INFO L273 TraceCheckUtils]: 31: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,206 INFO L273 TraceCheckUtils]: 32: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,206 INFO L273 TraceCheckUtils]: 33: Hoare triple {1698#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,207 INFO L273 TraceCheckUtils]: 35: Hoare triple {1698#false} assume !(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {1698#false} 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); {1698#false} is VALID [2018-11-23 12:13:22,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,207 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1698#false} {1698#false} #86#return; {1698#false} is VALID [2018-11-23 12:13:22,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {1698#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1698#false} is VALID [2018-11-23 12:13:22,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {1698#false} assume !!(~i~2 < 4);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; {1698#false} is VALID [2018-11-23 12:13:22,208 INFO L273 TraceCheckUtils]: 41: Hoare triple {1698#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1698#false} is VALID [2018-11-23 12:13:22,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {1698#false} assume !(~i~2 < 4); {1698#false} is VALID [2018-11-23 12:13:22,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {1698#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1698#false} is VALID [2018-11-23 12:13:22,209 INFO L256 TraceCheckUtils]: 44: Hoare triple {1698#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {1698#false} ~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; {1698#false} is VALID [2018-11-23 12:13:22,209 INFO L273 TraceCheckUtils]: 46: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {1698#false} assume !(~i~1 > 2); {1698#false} is VALID [2018-11-23 12:13:22,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {1698#false} assume !!(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {1698#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {1698#false} assume !(~i~1 < 5); {1698#false} is VALID [2018-11-23 12:13:22,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {1698#false} 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); {1698#false} is VALID [2018-11-23 12:13:22,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,211 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1698#false} {1698#false} #88#return; {1698#false} is VALID [2018-11-23 12:13:22,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {1698#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1698#false} is VALID [2018-11-23 12:13:22,212 INFO L273 TraceCheckUtils]: 57: Hoare triple {1698#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:22,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2018-11-23 12:13:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:22,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:22,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:22,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:22,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:22,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:22,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:22,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:22,273 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2018-11-23 12:13:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,405 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 12:13:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:22,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:22,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:13:22,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:22,495 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:22,495 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:13:22,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:13:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 12:13:22,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:22,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:22,569 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:22,569 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,572 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:22,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:22,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:22,573 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:22,573 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,576 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:22,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:22,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:22,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:13:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 12:13:22,579 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 59 [2018-11-23 12:13:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:22,579 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 12:13:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:13:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:13:22,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:22,581 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:22,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:22,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash 804630256, now seen corresponding path program 2 times [2018-11-23 12:13:22,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:22,598 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:22,598 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:22,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:22,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:22,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:22,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:22,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-23 12:13:22,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2112#true} is VALID [2018-11-23 12:13:22,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-23 12:13:22,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #78#return; {2112#true} is VALID [2018-11-23 12:13:22,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret12 := main(); {2112#true} is VALID [2018-11-23 12:13:22,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {2112#true} is VALID [2018-11-23 12:13:22,804 INFO L256 TraceCheckUtils]: 6: Hoare triple {2112#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2112#true} is VALID [2018-11-23 12:13:22,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {2112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {2138#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:22,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {2145#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:22,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {2145#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2152#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:22,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {2152#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2113#false} is VALID [2018-11-23 12:13:22,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:22,814 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2113#false} {2112#true} #82#return; {2113#false} is VALID [2018-11-23 12:13:22,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {2113#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:22,815 INFO L256 TraceCheckUtils]: 16: Hoare triple {2113#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:22,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {2113#false} ~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; {2113#false} is VALID [2018-11-23 12:13:22,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !(~i~1 > 2); {2113#false} is VALID [2018-11-23 12:13:22,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {2113#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:22,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {2113#false} assume !(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {2113#false} 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); {2113#false} is VALID [2018-11-23 12:13:22,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:22,817 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2113#false} {2113#false} #84#return; {2113#false} is VALID [2018-11-23 12:13:22,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {2113#false} 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); {2113#false} is VALID [2018-11-23 12:13:22,818 INFO L256 TraceCheckUtils]: 29: Hoare triple {2113#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:22,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {2113#false} ~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; {2113#false} is VALID [2018-11-23 12:13:22,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {2113#false} assume !(~i~1 > 2); {2113#false} is VALID [2018-11-23 12:13:22,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {2113#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:22,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,820 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#false} assume !(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {2113#false} 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); {2113#false} is VALID [2018-11-23 12:13:22,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:22,820 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2113#false} {2113#false} #86#return; {2113#false} is VALID [2018-11-23 12:13:22,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {2113#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2113#false} is VALID [2018-11-23 12:13:22,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {2113#false} assume !!(~i~2 < 4);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; {2113#false} is VALID [2018-11-23 12:13:22,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {2113#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2113#false} is VALID [2018-11-23 12:13:22,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {2113#false} assume !(~i~2 < 4); {2113#false} is VALID [2018-11-23 12:13:22,822 INFO L273 TraceCheckUtils]: 45: Hoare triple {2113#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2113#false} is VALID [2018-11-23 12:13:22,822 INFO L256 TraceCheckUtils]: 46: Hoare triple {2113#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:22,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {2113#false} ~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; {2113#false} is VALID [2018-11-23 12:13:22,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,823 INFO L273 TraceCheckUtils]: 49: Hoare triple {2113#false} assume !(~i~1 > 2); {2113#false} is VALID [2018-11-23 12:13:22,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,823 INFO L273 TraceCheckUtils]: 51: Hoare triple {2113#false} assume !!(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,823 INFO L273 TraceCheckUtils]: 52: Hoare triple {2113#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:22,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:22,824 INFO L273 TraceCheckUtils]: 54: Hoare triple {2113#false} assume !(~i~1 < 5); {2113#false} is VALID [2018-11-23 12:13:22,824 INFO L273 TraceCheckUtils]: 55: Hoare triple {2113#false} 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); {2113#false} is VALID [2018-11-23 12:13:22,824 INFO L273 TraceCheckUtils]: 56: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:22,824 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2113#false} {2113#false} #88#return; {2113#false} is VALID [2018-11-23 12:13:22,825 INFO L273 TraceCheckUtils]: 58: Hoare triple {2113#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2113#false} is VALID [2018-11-23 12:13:22,825 INFO L273 TraceCheckUtils]: 59: Hoare triple {2113#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:22,825 INFO L273 TraceCheckUtils]: 60: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-23 12:13:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:22,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:22,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:22,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:22,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:22,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:22,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:22,941 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 12:13:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,207 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 12:13:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:23,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:23,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-23 12:13:23,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:23,357 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:13:23,357 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:13:23,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:13:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 12:13:23,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:23,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,389 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,389 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,391 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:23,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,392 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:23,392 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,394 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:23,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:23,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:13:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:13:23,397 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 61 [2018-11-23 12:13:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:23,397 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:13:23,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:13:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:13:23,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:23,398 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 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 12:13:23,399 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:23,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1929644946, now seen corresponding path program 3 times [2018-11-23 12:13:23,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:23,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:23,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:23,414 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:23,414 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:23,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:23,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:23,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:13:23,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:23,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:23,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {2544#true} call ULTIMATE.init(); {2544#true} is VALID [2018-11-23 12:13:23,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {2544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2544#true} is VALID [2018-11-23 12:13:23,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:23,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2544#true} {2544#true} #78#return; {2544#true} is VALID [2018-11-23 12:13:23,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {2544#true} call #t~ret12 := main(); {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {2544#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L256 TraceCheckUtils]: 6: Hoare triple {2544#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {2544#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:23,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {2544#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:23,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:23,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {2544#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:23,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:23,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {2544#true} assume !(~i~0 < 5); {2544#true} is VALID [2018-11-23 12:13:23,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:23,631 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2544#true} {2544#true} #82#return; {2544#true} is VALID [2018-11-23 12:13:23,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2544#true} is VALID [2018-11-23 12:13:23,631 INFO L256 TraceCheckUtils]: 18: Hoare triple {2544#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:23,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#true} ~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; {2544#true} is VALID [2018-11-23 12:13:23,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#true} assume !!(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {2544#true} assume !(~i~1 > 2); {2544#true} is VALID [2018-11-23 12:13:23,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:23,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {2544#true} assume !!(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {2544#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2544#true} is VALID [2018-11-23 12:13:23,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:23,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#true} assume !(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {2544#true} 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); {2544#true} is VALID [2018-11-23 12:13:23,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:23,633 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2544#true} {2544#true} #84#return; {2544#true} is VALID [2018-11-23 12:13:23,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {2544#true} 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); {2544#true} is VALID [2018-11-23 12:13:23,634 INFO L256 TraceCheckUtils]: 31: Hoare triple {2544#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:23,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {2544#true} ~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; {2544#true} is VALID [2018-11-23 12:13:23,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {2544#true} assume !!(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {2544#true} assume !(~i~1 > 2); {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {2544#true} assume !!(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {2544#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:23,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {2544#true} assume !(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {2544#true} 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); {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2544#true} {2544#true} #86#return; {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {2544#true} 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; {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {2544#true} assume !!(~i~2 < 4);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; {2544#true} is VALID [2018-11-23 12:13:23,636 INFO L273 TraceCheckUtils]: 45: Hoare triple {2544#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2544#true} is VALID [2018-11-23 12:13:23,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {2544#true} assume !(~i~2 < 4); {2544#true} is VALID [2018-11-23 12:13:23,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {2544#true} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2544#true} is VALID [2018-11-23 12:13:23,637 INFO L256 TraceCheckUtils]: 48: Hoare triple {2544#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:23,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {2544#true} ~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; {2544#true} is VALID [2018-11-23 12:13:23,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {2544#true} assume !!(~i~1 < 5); {2544#true} is VALID [2018-11-23 12:13:23,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {2544#true} assume !(~i~1 > 2); {2702#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:23,662 INFO L273 TraceCheckUtils]: 52: Hoare triple {2702#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2706#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:23,663 INFO L273 TraceCheckUtils]: 53: Hoare triple {2706#(<= rangesum_~i~1 3)} assume !!(~i~1 < 5); {2706#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:23,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {2706#(<= rangesum_~i~1 3)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2706#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:23,664 INFO L273 TraceCheckUtils]: 55: Hoare triple {2706#(<= rangesum_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2716#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:13:23,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {2716#(<= rangesum_~i~1 4)} assume !(~i~1 < 5); {2545#false} is VALID [2018-11-23 12:13:23,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {2545#false} 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); {2545#false} is VALID [2018-11-23 12:13:23,666 INFO L273 TraceCheckUtils]: 58: Hoare triple {2545#false} assume true; {2545#false} is VALID [2018-11-23 12:13:23,666 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2545#false} {2544#true} #88#return; {2545#false} is VALID [2018-11-23 12:13:23,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {2545#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2545#false} is VALID [2018-11-23 12:13:23,666 INFO L273 TraceCheckUtils]: 61: Hoare triple {2545#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2545#false} is VALID [2018-11-23 12:13:23,667 INFO L273 TraceCheckUtils]: 62: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2018-11-23 12:13:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 12:13:23,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:23,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:23,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:23,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:23,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:23,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:23,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:23,735 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-23 12:13:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,428 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 12:13:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:24,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:24,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-23 12:13:24,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:24,689 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:24,689 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:13:24,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:13:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:13:24,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:24,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 12:13:24,712 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:13:24,712 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:13:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,714 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:13:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:13:24,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:24,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:24,715 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:13:24,715 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:13:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,718 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:13:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:13:24,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:24,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:24,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:24,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:13:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 12:13:24,720 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2018-11-23 12:13:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:24,721 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 12:13:24,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:13:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:13:24,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:24,722 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:24,722 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:24,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash -575638740, now seen corresponding path program 4 times [2018-11-23 12:13:24,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:24,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,737 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:24,738 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:24,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:24,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:24,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:24,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:25,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {2988#true} call ULTIMATE.init(); {2988#true} is VALID [2018-11-23 12:13:25,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {2988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2988#true} is VALID [2018-11-23 12:13:25,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {2988#true} assume true; {2988#true} is VALID [2018-11-23 12:13:25,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2988#true} {2988#true} #78#return; {2988#true} is VALID [2018-11-23 12:13:25,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {2988#true} call #t~ret12 := main(); {2988#true} is VALID [2018-11-23 12:13:25,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {2988#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {2988#true} is VALID [2018-11-23 12:13:25,005 INFO L256 TraceCheckUtils]: 6: Hoare triple {2988#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2988#true} is VALID [2018-11-23 12:13:25,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2988#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3014#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:25,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {3014#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3014#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:25,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {3014#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3021#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:25,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {3021#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3021#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:25,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {3021#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3028#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:25,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {3028#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3028#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:25,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {3028#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3035#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:25,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {3035#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2989#false} is VALID [2018-11-23 12:13:25,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {2989#false} assume true; {2989#false} is VALID [2018-11-23 12:13:25,010 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2989#false} {2988#true} #82#return; {2989#false} is VALID [2018-11-23 12:13:25,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {2989#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2989#false} is VALID [2018-11-23 12:13:25,011 INFO L256 TraceCheckUtils]: 18: Hoare triple {2989#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2989#false} is VALID [2018-11-23 12:13:25,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {2989#false} ~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; {2989#false} is VALID [2018-11-23 12:13:25,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {2989#false} assume !(~i~1 > 2); {2989#false} is VALID [2018-11-23 12:13:25,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,013 INFO L273 TraceCheckUtils]: 28: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {2989#false} assume !(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {2989#false} 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); {2989#false} is VALID [2018-11-23 12:13:25,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {2989#false} assume true; {2989#false} is VALID [2018-11-23 12:13:25,015 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2989#false} {2989#false} #84#return; {2989#false} is VALID [2018-11-23 12:13:25,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {2989#false} 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); {2989#false} is VALID [2018-11-23 12:13:25,015 INFO L256 TraceCheckUtils]: 34: Hoare triple {2989#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2989#false} is VALID [2018-11-23 12:13:25,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {2989#false} ~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; {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {2989#false} assume !(~i~1 > 2); {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L273 TraceCheckUtils]: 45: Hoare triple {2989#false} assume !(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L273 TraceCheckUtils]: 46: Hoare triple {2989#false} 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); {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L273 TraceCheckUtils]: 47: Hoare triple {2989#false} assume true; {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2989#false} {2989#false} #86#return; {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {2989#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2989#false} is VALID [2018-11-23 12:13:25,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {2989#false} assume !!(~i~2 < 4);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; {2989#false} is VALID [2018-11-23 12:13:25,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {2989#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2989#false} is VALID [2018-11-23 12:13:25,019 INFO L273 TraceCheckUtils]: 52: Hoare triple {2989#false} assume !(~i~2 < 4); {2989#false} is VALID [2018-11-23 12:13:25,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {2989#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2989#false} is VALID [2018-11-23 12:13:25,019 INFO L256 TraceCheckUtils]: 54: Hoare triple {2989#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2989#false} is VALID [2018-11-23 12:13:25,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {2989#false} ~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; {2989#false} is VALID [2018-11-23 12:13:25,020 INFO L273 TraceCheckUtils]: 56: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {2989#false} assume !(~i~1 > 2); {2989#false} is VALID [2018-11-23 12:13:25,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,021 INFO L273 TraceCheckUtils]: 61: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {2989#false} assume !!(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {2989#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2989#false} is VALID [2018-11-23 12:13:25,021 INFO L273 TraceCheckUtils]: 64: Hoare triple {2989#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2989#false} is VALID [2018-11-23 12:13:25,021 INFO L273 TraceCheckUtils]: 65: Hoare triple {2989#false} assume !(~i~1 < 5); {2989#false} is VALID [2018-11-23 12:13:25,022 INFO L273 TraceCheckUtils]: 66: Hoare triple {2989#false} 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); {2989#false} is VALID [2018-11-23 12:13:25,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {2989#false} assume true; {2989#false} is VALID [2018-11-23 12:13:25,022 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2989#false} {2989#false} #88#return; {2989#false} is VALID [2018-11-23 12:13:25,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {2989#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2989#false} is VALID [2018-11-23 12:13:25,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {2989#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2989#false} is VALID [2018-11-23 12:13:25,023 INFO L273 TraceCheckUtils]: 71: Hoare triple {2989#false} assume !false; {2989#false} is VALID [2018-11-23 12:13:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-23 12:13:25,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:25,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:25,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 12:13:25,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:25,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:25,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:25,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:25,108 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2018-11-23 12:13:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,530 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-23 12:13:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:25,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 12:13:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:25,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2018-11-23 12:13:25,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:25,607 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:13:25,607 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:13:25,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 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 12:13:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:13:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 12:13:25,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:25,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,650 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,650 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,652 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:13:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 12:13:25,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:25,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:25,653 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 12:13:25,653 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 12:13:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,655 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:13:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 12:13:25,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:25,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:25,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:25,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:13:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-23 12:13:25,658 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 72 [2018-11-23 12:13:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:25,658 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-23 12:13:25,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:13:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:13:25,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:25,660 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 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 12:13:25,660 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:25,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash -336825618, now seen corresponding path program 5 times [2018-11-23 12:13:25,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:25,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:25,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:25,676 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:25,676 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:25,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:25,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:25,760 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:13:25,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:25,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:25,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {3482#true} call ULTIMATE.init(); {3482#true} is VALID [2018-11-23 12:13:25,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {3482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3482#true} is VALID [2018-11-23 12:13:25,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {3482#true} assume true; {3482#true} is VALID [2018-11-23 12:13:25,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3482#true} {3482#true} #78#return; {3482#true} is VALID [2018-11-23 12:13:25,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {3482#true} call #t~ret12 := main(); {3482#true} is VALID [2018-11-23 12:13:25,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {3482#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {3482#true} is VALID [2018-11-23 12:13:25,888 INFO L256 TraceCheckUtils]: 6: Hoare triple {3482#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3482#true} is VALID [2018-11-23 12:13:25,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {3482#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3482#true} is VALID [2018-11-23 12:13:25,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {3482#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3482#true} is VALID [2018-11-23 12:13:25,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {3482#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#true} is VALID [2018-11-23 12:13:25,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {3482#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3482#true} is VALID [2018-11-23 12:13:25,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {3482#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#true} is VALID [2018-11-23 12:13:25,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {3482#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3482#true} is VALID [2018-11-23 12:13:25,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {3482#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#true} is VALID [2018-11-23 12:13:25,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {3482#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3482#true} is VALID [2018-11-23 12:13:25,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {3482#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3482#true} is VALID [2018-11-23 12:13:25,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {3482#true} assume !(~i~0 < 5); {3482#true} is VALID [2018-11-23 12:13:25,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {3482#true} assume true; {3482#true} is VALID [2018-11-23 12:13:25,891 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3482#true} {3482#true} #82#return; {3482#true} is VALID [2018-11-23 12:13:25,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {3482#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3482#true} is VALID [2018-11-23 12:13:25,891 INFO L256 TraceCheckUtils]: 20: Hoare triple {3482#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3482#true} is VALID [2018-11-23 12:13:25,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {3482#true} ~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; {3482#true} is VALID [2018-11-23 12:13:25,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {3482#true} assume !!(~i~1 < 5); {3482#true} is VALID [2018-11-23 12:13:25,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {3482#true} assume !(~i~1 > 2); {3482#true} is VALID [2018-11-23 12:13:25,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {3482#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3482#true} is VALID [2018-11-23 12:13:25,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {3482#true} assume !!(~i~1 < 5); {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {3482#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {3482#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {3482#true} assume !!(~i~1 < 5); {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {3482#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {3482#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3482#true} is VALID [2018-11-23 12:13:25,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {3482#true} assume !(~i~1 < 5); {3482#true} is VALID [2018-11-23 12:13:25,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {3482#true} 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); {3482#true} is VALID [2018-11-23 12:13:25,894 INFO L273 TraceCheckUtils]: 33: Hoare triple {3482#true} assume true; {3482#true} is VALID [2018-11-23 12:13:25,894 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3482#true} {3482#true} #84#return; {3482#true} is VALID [2018-11-23 12:13:25,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {3482#true} 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); {3482#true} is VALID [2018-11-23 12:13:25,894 INFO L256 TraceCheckUtils]: 36: Hoare triple {3482#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3482#true} is VALID [2018-11-23 12:13:25,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {3482#true} ~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; {3598#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:25,898 INFO L273 TraceCheckUtils]: 38: Hoare triple {3598#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {3598#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:25,898 INFO L273 TraceCheckUtils]: 39: Hoare triple {3598#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {3598#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:25,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {3598#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3608#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:25,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {3608#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {3608#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {3608#(<= rangesum_~i~1 1)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {3483#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {3483#false} assume !!(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 45: Hoare triple {3483#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {3483#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {3483#false} assume !(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {3483#false} 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); {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {3483#false} assume true; {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3483#false} {3482#true} #86#return; {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {3483#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {3483#false} assume !!(~i~2 < 4);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; {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {3483#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {3483#false} assume !(~i~2 < 4); {3483#false} is VALID [2018-11-23 12:13:25,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {3483#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L256 TraceCheckUtils]: 56: Hoare triple {3483#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 57: Hoare triple {3483#false} ~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; {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 58: Hoare triple {3483#false} assume !!(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {3483#false} assume !(~i~1 > 2); {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {3483#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {3483#false} assume !!(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {3483#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3483#false} is VALID [2018-11-23 12:13:25,904 INFO L273 TraceCheckUtils]: 63: Hoare triple {3483#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 64: Hoare triple {3483#false} assume !!(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 65: Hoare triple {3483#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {3483#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 67: Hoare triple {3483#false} assume !(~i~1 < 5); {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 68: Hoare triple {3483#false} 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); {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 69: Hoare triple {3483#false} assume true; {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3483#false} {3483#false} #88#return; {3483#false} is VALID [2018-11-23 12:13:25,905 INFO L273 TraceCheckUtils]: 71: Hoare triple {3483#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3483#false} is VALID [2018-11-23 12:13:25,906 INFO L273 TraceCheckUtils]: 72: Hoare triple {3483#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3483#false} is VALID [2018-11-23 12:13:25,906 INFO L273 TraceCheckUtils]: 73: Hoare triple {3483#false} assume !false; {3483#false} is VALID [2018-11-23 12:13:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:13:25,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:25,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:25,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-23 12:13:25,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:25,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:25,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:25,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:25,975 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-11-23 12:13:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,137 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 12:13:26,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:26,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-23 12:13:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:26,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:13:26,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:26,317 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:13:26,317 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:13:26,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:13:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 12:13:26,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:26,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,359 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,359 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,360 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:13:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:13:26,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,361 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 12:13:26,361 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 12:13:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,362 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:13:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:13:26,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:26,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:13:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 12:13:26,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 74 [2018-11-23 12:13:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:26,365 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 12:13:26,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 12:13:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:13:26,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:26,366 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 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, 1, 1] [2018-11-23 12:13:26,366 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:26,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1535873938, now seen corresponding path program 6 times [2018-11-23 12:13:26,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:26,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,380 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:26,381 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:26,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:26,409 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:26,492 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:13:26,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:26,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:26,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {3989#true} call ULTIMATE.init(); {3989#true} is VALID [2018-11-23 12:13:26,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {3989#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3989#true} is VALID [2018-11-23 12:13:26,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {3989#true} assume true; {3989#true} is VALID [2018-11-23 12:13:26,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3989#true} {3989#true} #78#return; {3989#true} is VALID [2018-11-23 12:13:26,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {3989#true} call #t~ret12 := main(); {3989#true} is VALID [2018-11-23 12:13:26,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {3989#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {3989#true} is VALID [2018-11-23 12:13:26,609 INFO L256 TraceCheckUtils]: 6: Hoare triple {3989#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3989#true} is VALID [2018-11-23 12:13:26,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {3989#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3989#true} is VALID [2018-11-23 12:13:26,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {3989#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {3989#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {3989#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {3989#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {3989#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {3989#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {3989#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3989#true} is VALID [2018-11-23 12:13:26,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {3989#true} assume !(~i~0 < 5); {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {3989#true} assume true; {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3989#true} {3989#true} #82#return; {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {3989#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L256 TraceCheckUtils]: 20: Hoare triple {3989#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {3989#true} ~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; {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {3989#true} assume !(~i~1 > 2); {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {3989#true} assume !(~i~1 > 2); {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {3989#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3989#true} is VALID [2018-11-23 12:13:26,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {3989#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3989#true} is VALID [2018-11-23 12:13:26,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {3989#true} assume !(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {3989#true} 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); {3989#true} is VALID [2018-11-23 12:13:26,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {3989#true} assume true; {3989#true} is VALID [2018-11-23 12:13:26,614 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3989#true} {3989#true} #84#return; {3989#true} is VALID [2018-11-23 12:13:26,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {3989#true} 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); {3989#true} is VALID [2018-11-23 12:13:26,614 INFO L256 TraceCheckUtils]: 39: Hoare triple {3989#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3989#true} is VALID [2018-11-23 12:13:26,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {3989#true} ~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; {3989#true} is VALID [2018-11-23 12:13:26,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {3989#true} assume !(~i~1 > 2); {3989#true} is VALID [2018-11-23 12:13:26,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 45: Hoare triple {3989#true} assume !(~i~1 > 2); {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 46: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 47: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {3989#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {3989#true} assume !!(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,617 INFO L273 TraceCheckUtils]: 51: Hoare triple {3989#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3989#true} is VALID [2018-11-23 12:13:26,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {3989#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3989#true} is VALID [2018-11-23 12:13:26,617 INFO L273 TraceCheckUtils]: 53: Hoare triple {3989#true} assume !(~i~1 < 5); {3989#true} is VALID [2018-11-23 12:13:26,617 INFO L273 TraceCheckUtils]: 54: Hoare triple {3989#true} 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); {3989#true} is VALID [2018-11-23 12:13:26,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {3989#true} assume true; {3989#true} is VALID [2018-11-23 12:13:26,618 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {3989#true} {3989#true} #86#return; {3989#true} is VALID [2018-11-23 12:13:26,630 INFO L273 TraceCheckUtils]: 57: Hoare triple {3989#true} 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; {4165#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:26,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {4165#(<= main_~i~2 0)} assume !!(~i~2 < 4);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; {4165#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:26,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {4165#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4172#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:26,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {4172#(<= main_~i~2 1)} assume !(~i~2 < 4); {3990#false} is VALID [2018-11-23 12:13:26,632 INFO L273 TraceCheckUtils]: 61: Hoare triple {3990#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3990#false} is VALID [2018-11-23 12:13:26,632 INFO L256 TraceCheckUtils]: 62: Hoare triple {3990#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3990#false} is VALID [2018-11-23 12:13:26,632 INFO L273 TraceCheckUtils]: 63: Hoare triple {3990#false} ~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; {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {3990#false} assume !!(~i~1 < 5); {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {3990#false} assume !(~i~1 > 2); {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {3990#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {3990#false} assume !!(~i~1 < 5); {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 68: Hoare triple {3990#false} assume !(~i~1 > 2); {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 69: Hoare triple {3990#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 70: Hoare triple {3990#false} assume !!(~i~1 < 5); {3990#false} is VALID [2018-11-23 12:13:26,633 INFO L273 TraceCheckUtils]: 71: Hoare triple {3990#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 72: Hoare triple {3990#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 73: Hoare triple {3990#false} assume !!(~i~1 < 5); {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 74: Hoare triple {3990#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 75: Hoare triple {3990#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 76: Hoare triple {3990#false} assume !(~i~1 < 5); {3990#false} is VALID [2018-11-23 12:13:26,634 INFO L273 TraceCheckUtils]: 77: Hoare triple {3990#false} 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); {3990#false} is VALID [2018-11-23 12:13:26,635 INFO L273 TraceCheckUtils]: 78: Hoare triple {3990#false} assume true; {3990#false} is VALID [2018-11-23 12:13:26,635 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {3990#false} {3990#false} #88#return; {3990#false} is VALID [2018-11-23 12:13:26,635 INFO L273 TraceCheckUtils]: 80: Hoare triple {3990#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3990#false} is VALID [2018-11-23 12:13:26,636 INFO L273 TraceCheckUtils]: 81: Hoare triple {3990#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3990#false} is VALID [2018-11-23 12:13:26,636 INFO L273 TraceCheckUtils]: 82: Hoare triple {3990#false} assume !false; {3990#false} is VALID [2018-11-23 12:13:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-23 12:13:26,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:26,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:26,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-23 12:13:26,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:26,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:26,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:26,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,713 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-11-23 12:13:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,835 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 12:13:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:26,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-23 12:13:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:26,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:13:26,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:26,904 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:13:26,904 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:13:26,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:13:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:13:26,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:26,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:26,936 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,938 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:13:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:13:26,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,938 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:13:26,939 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:13:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,940 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:13:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:13:26,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:26,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:13:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 12:13:26,943 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 83 [2018-11-23 12:13:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:26,943 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 12:13:26,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:13:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:13:26,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:26,944 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:26,945 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:26,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2064866548, now seen corresponding path program 7 times [2018-11-23 12:13:26,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:26,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,958 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:26,958 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:26,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:26,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:27,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:27,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {4528#true} call ULTIMATE.init(); {4528#true} is VALID [2018-11-23 12:13:27,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {4528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4528#true} is VALID [2018-11-23 12:13:27,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2018-11-23 12:13:27,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #78#return; {4528#true} is VALID [2018-11-23 12:13:27,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret12 := main(); {4528#true} is VALID [2018-11-23 12:13:27,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {4528#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {4528#true} is VALID [2018-11-23 12:13:27,238 INFO L256 TraceCheckUtils]: 6: Hoare triple {4528#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4528#true} is VALID [2018-11-23 12:13:27,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {4528#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4554#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:27,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {4554#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4554#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:27,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {4554#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4561#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:27,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {4561#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4561#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:27,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {4561#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4568#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:27,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {4568#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4568#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:27,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {4568#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4575#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:27,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {4575#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4575#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:27,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {4575#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4582#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:27,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {4582#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {4529#false} is VALID [2018-11-23 12:13:27,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {4529#false} assume true; {4529#false} is VALID [2018-11-23 12:13:27,243 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {4529#false} {4528#true} #82#return; {4529#false} is VALID [2018-11-23 12:13:27,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {4529#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4529#false} is VALID [2018-11-23 12:13:27,244 INFO L256 TraceCheckUtils]: 20: Hoare triple {4529#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4529#false} is VALID [2018-11-23 12:13:27,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {4529#false} ~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; {4529#false} is VALID [2018-11-23 12:13:27,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 33: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,247 INFO L273 TraceCheckUtils]: 34: Hoare triple {4529#false} assume !(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L273 TraceCheckUtils]: 35: Hoare triple {4529#false} 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); {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L273 TraceCheckUtils]: 36: Hoare triple {4529#false} assume true; {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4529#false} {4529#false} #84#return; {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {4529#false} 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); {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L256 TraceCheckUtils]: 39: Hoare triple {4529#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4529#false} is VALID [2018-11-23 12:13:27,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {4529#false} ~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; {4529#false} is VALID [2018-11-23 12:13:27,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,249 INFO L273 TraceCheckUtils]: 42: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,249 INFO L273 TraceCheckUtils]: 43: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 46: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 48: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 49: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 50: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L273 TraceCheckUtils]: 52: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {4529#false} assume !(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {4529#false} 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); {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {4529#false} assume true; {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {4529#false} {4529#false} #86#return; {4529#false} is VALID [2018-11-23 12:13:27,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {4529#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {4529#false} assume !!(~i~2 < 4);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; {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {4529#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 60: Hoare triple {4529#false} assume !!(~i~2 < 4);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; {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 61: Hoare triple {4529#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {4529#false} assume !(~i~2 < 4); {4529#false} is VALID [2018-11-23 12:13:27,252 INFO L273 TraceCheckUtils]: 63: Hoare triple {4529#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L256 TraceCheckUtils]: 64: Hoare triple {4529#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {4529#false} ~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; {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L273 TraceCheckUtils]: 68: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,253 INFO L273 TraceCheckUtils]: 69: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 70: Hoare triple {4529#false} assume !(~i~1 > 2); {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 71: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 72: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 73: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 74: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,254 INFO L273 TraceCheckUtils]: 75: Hoare triple {4529#false} assume !!(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,255 INFO L273 TraceCheckUtils]: 76: Hoare triple {4529#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4529#false} is VALID [2018-11-23 12:13:27,255 INFO L273 TraceCheckUtils]: 77: Hoare triple {4529#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4529#false} is VALID [2018-11-23 12:13:27,255 INFO L273 TraceCheckUtils]: 78: Hoare triple {4529#false} assume !(~i~1 < 5); {4529#false} is VALID [2018-11-23 12:13:27,255 INFO L273 TraceCheckUtils]: 79: Hoare triple {4529#false} 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); {4529#false} is VALID [2018-11-23 12:13:27,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {4529#false} assume true; {4529#false} is VALID [2018-11-23 12:13:27,256 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4529#false} {4529#false} #88#return; {4529#false} is VALID [2018-11-23 12:13:27,256 INFO L273 TraceCheckUtils]: 82: Hoare triple {4529#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4529#false} is VALID [2018-11-23 12:13:27,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {4529#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4529#false} is VALID [2018-11-23 12:13:27,256 INFO L273 TraceCheckUtils]: 84: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2018-11-23 12:13:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:13:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:27,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:27,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 12:13:27,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:27,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:27,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:27,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:27,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:27,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:27,330 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-23 12:13:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:27,594 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-23 12:13:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:27,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 12:13:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 12:13:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 12:13:27,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-23 12:13:27,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:27,669 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:13:27,670 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:13:27,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:13:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 12:13:27,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:27,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 12:13:27,690 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:13:27,690 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:13:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:27,692 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:13:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:13:27,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:27,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:27,693 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:13:27,693 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:13:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:27,695 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:13:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:13:27,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:27,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:27,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:27,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:13:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-23 12:13:27,697 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 85 [2018-11-23 12:13:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:27,697 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-23 12:13:27,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:13:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:13:27,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:27,698 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:27,698 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:27,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -998650230, now seen corresponding path program 8 times [2018-11-23 12:13:27,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:27,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:27,714 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:27,714 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:27,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:27,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:27,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:27,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:27,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:27,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {5100#true} call ULTIMATE.init(); {5100#true} is VALID [2018-11-23 12:13:27,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {5100#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5100#true} is VALID [2018-11-23 12:13:27,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {5100#true} assume true; {5100#true} is VALID [2018-11-23 12:13:27,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5100#true} {5100#true} #78#return; {5100#true} is VALID [2018-11-23 12:13:27,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {5100#true} call #t~ret12 := main(); {5100#true} is VALID [2018-11-23 12:13:27,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {5100#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {5100#true} is VALID [2018-11-23 12:13:27,930 INFO L256 TraceCheckUtils]: 6: Hoare triple {5100#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5100#true} is VALID [2018-11-23 12:13:27,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {5100#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5100#true} is VALID [2018-11-23 12:13:27,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {5100#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5100#true} is VALID [2018-11-23 12:13:27,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {5100#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#true} is VALID [2018-11-23 12:13:27,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {5100#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5100#true} is VALID [2018-11-23 12:13:27,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {5100#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#true} is VALID [2018-11-23 12:13:27,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {5100#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5100#true} is VALID [2018-11-23 12:13:27,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {5100#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#true} is VALID [2018-11-23 12:13:27,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {5100#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5100#true} is VALID [2018-11-23 12:13:27,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {5100#true} assume !(~i~0 < 5); {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {5100#true} assume true; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5100#true} {5100#true} #82#return; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {5100#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5100#true} is VALID [2018-11-23 12:13:27,933 INFO L256 TraceCheckUtils]: 22: Hoare triple {5100#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5100#true} is VALID [2018-11-23 12:13:27,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {5100#true} ~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; {5174#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:27,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {5174#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {5174#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:27,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {5174#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {5174#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:27,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {5174#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5184#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:27,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {5184#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {5184#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:27,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {5184#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {5184#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:27,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {5184#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5194#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:27,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {5194#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {5194#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:27,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {5194#(<= rangesum_~i~1 2)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {5101#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {5101#false} assume !(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {5101#false} 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); {5101#false} is VALID [2018-11-23 12:13:27,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {5101#false} assume true; {5101#false} is VALID [2018-11-23 12:13:27,971 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5101#false} {5100#true} #84#return; {5101#false} is VALID [2018-11-23 12:13:27,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {5101#false} 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); {5101#false} is VALID [2018-11-23 12:13:27,971 INFO L256 TraceCheckUtils]: 41: Hoare triple {5101#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5101#false} is VALID [2018-11-23 12:13:27,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {5101#false} ~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; {5101#false} is VALID [2018-11-23 12:13:27,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,972 INFO L273 TraceCheckUtils]: 44: Hoare triple {5101#false} assume !(~i~1 > 2); {5101#false} is VALID [2018-11-23 12:13:27,972 INFO L273 TraceCheckUtils]: 45: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {5101#false} assume !(~i~1 > 2); {5101#false} is VALID [2018-11-23 12:13:27,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,973 INFO L273 TraceCheckUtils]: 50: Hoare triple {5101#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,973 INFO L273 TraceCheckUtils]: 51: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,973 INFO L273 TraceCheckUtils]: 52: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {5101#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,974 INFO L273 TraceCheckUtils]: 54: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,974 INFO L273 TraceCheckUtils]: 55: Hoare triple {5101#false} assume !(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,974 INFO L273 TraceCheckUtils]: 56: Hoare triple {5101#false} 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); {5101#false} is VALID [2018-11-23 12:13:27,974 INFO L273 TraceCheckUtils]: 57: Hoare triple {5101#false} assume true; {5101#false} is VALID [2018-11-23 12:13:27,975 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {5101#false} {5101#false} #86#return; {5101#false} is VALID [2018-11-23 12:13:27,975 INFO L273 TraceCheckUtils]: 59: Hoare triple {5101#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5101#false} is VALID [2018-11-23 12:13:27,975 INFO L273 TraceCheckUtils]: 60: Hoare triple {5101#false} assume !!(~i~2 < 4);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; {5101#false} is VALID [2018-11-23 12:13:27,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {5101#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5101#false} is VALID [2018-11-23 12:13:27,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {5101#false} assume !!(~i~2 < 4);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; {5101#false} is VALID [2018-11-23 12:13:27,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {5101#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5101#false} is VALID [2018-11-23 12:13:27,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {5101#false} assume !(~i~2 < 4); {5101#false} is VALID [2018-11-23 12:13:27,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {5101#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {5101#false} is VALID [2018-11-23 12:13:27,976 INFO L256 TraceCheckUtils]: 66: Hoare triple {5101#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5101#false} is VALID [2018-11-23 12:13:27,977 INFO L273 TraceCheckUtils]: 67: Hoare triple {5101#false} ~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; {5101#false} is VALID [2018-11-23 12:13:27,977 INFO L273 TraceCheckUtils]: 68: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,977 INFO L273 TraceCheckUtils]: 69: Hoare triple {5101#false} assume !(~i~1 > 2); {5101#false} is VALID [2018-11-23 12:13:27,977 INFO L273 TraceCheckUtils]: 70: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,977 INFO L273 TraceCheckUtils]: 71: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,978 INFO L273 TraceCheckUtils]: 72: Hoare triple {5101#false} assume !(~i~1 > 2); {5101#false} is VALID [2018-11-23 12:13:27,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,978 INFO L273 TraceCheckUtils]: 74: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,978 INFO L273 TraceCheckUtils]: 75: Hoare triple {5101#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,979 INFO L273 TraceCheckUtils]: 77: Hoare triple {5101#false} assume !!(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {5101#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5101#false} is VALID [2018-11-23 12:13:27,979 INFO L273 TraceCheckUtils]: 79: Hoare triple {5101#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5101#false} is VALID [2018-11-23 12:13:27,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {5101#false} assume !(~i~1 < 5); {5101#false} is VALID [2018-11-23 12:13:27,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {5101#false} 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); {5101#false} is VALID [2018-11-23 12:13:27,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {5101#false} assume true; {5101#false} is VALID [2018-11-23 12:13:27,980 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {5101#false} {5101#false} #88#return; {5101#false} is VALID [2018-11-23 12:13:27,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {5101#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5101#false} is VALID [2018-11-23 12:13:27,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {5101#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5101#false} is VALID [2018-11-23 12:13:27,981 INFO L273 TraceCheckUtils]: 86: Hoare triple {5101#false} assume !false; {5101#false} is VALID [2018-11-23 12:13:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-23 12:13:28,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:28,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:28,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 12:13:28,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:28,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:28,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:28,124 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-11-23 12:13:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,308 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-11-23 12:13:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:28,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 12:13:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 12:13:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 12:13:28,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2018-11-23 12:13:28,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:28,410 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:13:28,410 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:13:28,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:13:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:13:28,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:28,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 12:13:28,579 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:13:28,580 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:13:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,583 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:13:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:13:28,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:28,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:28,584 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:13:28,584 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:13:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,586 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:13:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:13:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:28,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:28,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:28,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:13:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-23 12:13:28,588 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 87 [2018-11-23 12:13:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:28,589 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-23 12:13:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:13:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:13:28,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:28,590 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:28,590 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1679580114, now seen corresponding path program 9 times [2018-11-23 12:13:28,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:28,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:28,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:28,603 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:28,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:28,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:29,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:13:29,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:29,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:29,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {5685#true} call ULTIMATE.init(); {5685#true} is VALID [2018-11-23 12:13:29,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {5685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5685#true} is VALID [2018-11-23 12:13:29,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {5685#true} assume true; {5685#true} is VALID [2018-11-23 12:13:29,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5685#true} {5685#true} #78#return; {5685#true} is VALID [2018-11-23 12:13:29,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {5685#true} call #t~ret12 := main(); {5685#true} is VALID [2018-11-23 12:13:29,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {5685#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {5685#true} is VALID [2018-11-23 12:13:29,243 INFO L256 TraceCheckUtils]: 6: Hoare triple {5685#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5685#true} is VALID [2018-11-23 12:13:29,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {5685#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {5685#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {5685#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {5685#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {5685#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {5685#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {5685#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5685#true} is VALID [2018-11-23 12:13:29,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {5685#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {5685#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {5685#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {5685#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {5685#true} assume !(~i~0 < 5); {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {5685#true} assume true; {5685#true} is VALID [2018-11-23 12:13:29,245 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5685#true} {5685#true} #82#return; {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {5685#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L256 TraceCheckUtils]: 22: Hoare triple {5685#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {5685#true} ~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; {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 33: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,247 INFO L273 TraceCheckUtils]: 34: Hoare triple {5685#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 35: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 36: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 37: Hoare triple {5685#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {5685#true} assume !(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {5685#true} 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); {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {5685#true} assume true; {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5685#true} {5685#true} #84#return; {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L273 TraceCheckUtils]: 43: Hoare triple {5685#true} 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); {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L256 TraceCheckUtils]: 44: Hoare triple {5685#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {5685#true} ~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; {5685#true} is VALID [2018-11-23 12:13:29,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 48: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 49: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 50: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,250 INFO L273 TraceCheckUtils]: 53: Hoare triple {5685#true} assume !(~i~1 > 2); {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 56: Hoare triple {5685#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 58: Hoare triple {5685#true} assume !!(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {5685#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5685#true} is VALID [2018-11-23 12:13:29,251 INFO L273 TraceCheckUtils]: 60: Hoare triple {5685#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5685#true} is VALID [2018-11-23 12:13:29,252 INFO L273 TraceCheckUtils]: 61: Hoare triple {5685#true} assume !(~i~1 < 5); {5685#true} is VALID [2018-11-23 12:13:29,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {5685#true} 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); {5685#true} is VALID [2018-11-23 12:13:29,252 INFO L273 TraceCheckUtils]: 63: Hoare triple {5685#true} assume true; {5685#true} is VALID [2018-11-23 12:13:29,252 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {5685#true} {5685#true} #86#return; {5685#true} is VALID [2018-11-23 12:13:29,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {5685#true} 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; {5885#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:29,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {5885#(<= main_~i~2 0)} assume !!(~i~2 < 4);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; {5885#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:29,254 INFO L273 TraceCheckUtils]: 67: Hoare triple {5885#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5892#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:29,254 INFO L273 TraceCheckUtils]: 68: Hoare triple {5892#(<= main_~i~2 1)} assume !!(~i~2 < 4);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; {5892#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:29,255 INFO L273 TraceCheckUtils]: 69: Hoare triple {5892#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5899#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:29,255 INFO L273 TraceCheckUtils]: 70: Hoare triple {5899#(<= main_~i~2 2)} assume !(~i~2 < 4); {5686#false} is VALID [2018-11-23 12:13:29,255 INFO L273 TraceCheckUtils]: 71: Hoare triple {5686#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {5686#false} is VALID [2018-11-23 12:13:29,256 INFO L256 TraceCheckUtils]: 72: Hoare triple {5686#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5686#false} is VALID [2018-11-23 12:13:29,256 INFO L273 TraceCheckUtils]: 73: Hoare triple {5686#false} ~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; {5686#false} is VALID [2018-11-23 12:13:29,256 INFO L273 TraceCheckUtils]: 74: Hoare triple {5686#false} assume !!(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,256 INFO L273 TraceCheckUtils]: 75: Hoare triple {5686#false} assume !(~i~1 > 2); {5686#false} is VALID [2018-11-23 12:13:29,257 INFO L273 TraceCheckUtils]: 76: Hoare triple {5686#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5686#false} is VALID [2018-11-23 12:13:29,257 INFO L273 TraceCheckUtils]: 77: Hoare triple {5686#false} assume !!(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,257 INFO L273 TraceCheckUtils]: 78: Hoare triple {5686#false} assume !(~i~1 > 2); {5686#false} is VALID [2018-11-23 12:13:29,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {5686#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5686#false} is VALID [2018-11-23 12:13:29,258 INFO L273 TraceCheckUtils]: 80: Hoare triple {5686#false} assume !!(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,258 INFO L273 TraceCheckUtils]: 81: Hoare triple {5686#false} assume !(~i~1 > 2); {5686#false} is VALID [2018-11-23 12:13:29,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {5686#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5686#false} is VALID [2018-11-23 12:13:29,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {5686#false} assume !!(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {5686#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5686#false} is VALID [2018-11-23 12:13:29,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {5686#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5686#false} is VALID [2018-11-23 12:13:29,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {5686#false} assume !!(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {5686#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {5686#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {5686#false} assume !(~i~1 < 5); {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {5686#false} 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); {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {5686#false} assume true; {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {5686#false} {5686#false} #88#return; {5686#false} is VALID [2018-11-23 12:13:29,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {5686#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5686#false} is VALID [2018-11-23 12:13:29,261 INFO L273 TraceCheckUtils]: 94: Hoare triple {5686#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5686#false} is VALID [2018-11-23 12:13:29,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {5686#false} assume !false; {5686#false} is VALID [2018-11-23 12:13:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 12:13:29,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:29,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:29,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-23 12:13:29,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:29,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:29,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:29,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:29,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:29,358 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-11-23 12:13:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:29,510 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-23 12:13:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:29,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-23 12:13:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:29,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-23 12:13:30,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:30,065 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:13:30,065 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:13:30,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:13:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 12:13:30,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:30,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 12:13:30,601 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 12:13:30,601 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 12:13:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:30,603 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 12:13:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 12:13:30,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:30,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:30,605 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 12:13:30,606 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 12:13:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:30,608 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 12:13:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 12:13:30,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:30,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:30,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:30,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:13:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-23 12:13:30,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 96 [2018-11-23 12:13:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:30,612 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-23 12:13:30,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:13:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:13:30,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:30,613 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 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] [2018-11-23 12:13:30,614 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:30,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2078244212, now seen corresponding path program 10 times [2018-11-23 12:13:30,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:30,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:30,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:30,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:30,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:30,637 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:30,639 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:30,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:13:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:30,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:30,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:30,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:30,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 12:13:30,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 12:13:30,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 12:13:30,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #78#return; {6302#true} is VALID [2018-11-23 12:13:30,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret12 := main(); {6302#true} is VALID [2018-11-23 12:13:30,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L256 TraceCheckUtils]: 6: Hoare triple {6302#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {6302#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {6302#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {6302#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {6302#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {6302#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {6302#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {6302#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6302#true} is VALID [2018-11-23 12:13:30,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {6302#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {6302#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {6302#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {6302#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {6302#true} assume !(~i~0 < 5); {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6302#true} {6302#true} #82#return; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {6302#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6302#true} is VALID [2018-11-23 12:13:30,962 INFO L256 TraceCheckUtils]: 22: Hoare triple {6302#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {6302#true} ~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; {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {6302#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {6302#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6302#true} is VALID [2018-11-23 12:13:30,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {6302#true} assume !(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {6302#true} 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); {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {6302#true} {6302#true} #84#return; {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {6302#true} 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); {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L256 TraceCheckUtils]: 44: Hoare triple {6302#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {6302#true} ~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; {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {6302#true} assume !(~i~1 > 2); {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {6302#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {6302#true} assume !!(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {6302#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {6302#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 61: Hoare triple {6302#true} assume !(~i~1 < 5); {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 62: Hoare triple {6302#true} 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); {6302#true} is VALID [2018-11-23 12:13:30,967 INFO L273 TraceCheckUtils]: 63: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 12:13:30,968 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {6302#true} {6302#true} #86#return; {6302#true} is VALID [2018-11-23 12:13:30,968 INFO L273 TraceCheckUtils]: 65: Hoare triple {6302#true} 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; {6502#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:30,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {6502#(<= main_~i~2 0)} assume !!(~i~2 < 4);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; {6502#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:30,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {6502#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6509#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:30,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {6509#(<= main_~i~2 1)} assume !!(~i~2 < 4);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; {6509#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:30,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {6509#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6516#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:30,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {6516#(<= main_~i~2 2)} assume !!(~i~2 < 4);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; {6516#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:30,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {6516#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6523#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:30,971 INFO L273 TraceCheckUtils]: 72: Hoare triple {6523#(<= main_~i~2 3)} assume !(~i~2 < 4); {6303#false} is VALID [2018-11-23 12:13:30,971 INFO L273 TraceCheckUtils]: 73: Hoare triple {6303#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {6303#false} is VALID [2018-11-23 12:13:30,972 INFO L256 TraceCheckUtils]: 74: Hoare triple {6303#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6303#false} is VALID [2018-11-23 12:13:30,972 INFO L273 TraceCheckUtils]: 75: Hoare triple {6303#false} ~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; {6303#false} is VALID [2018-11-23 12:13:30,972 INFO L273 TraceCheckUtils]: 76: Hoare triple {6303#false} assume !!(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,972 INFO L273 TraceCheckUtils]: 77: Hoare triple {6303#false} assume !(~i~1 > 2); {6303#false} is VALID [2018-11-23 12:13:30,972 INFO L273 TraceCheckUtils]: 78: Hoare triple {6303#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6303#false} is VALID [2018-11-23 12:13:30,973 INFO L273 TraceCheckUtils]: 79: Hoare triple {6303#false} assume !!(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,973 INFO L273 TraceCheckUtils]: 80: Hoare triple {6303#false} assume !(~i~1 > 2); {6303#false} is VALID [2018-11-23 12:13:30,973 INFO L273 TraceCheckUtils]: 81: Hoare triple {6303#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6303#false} is VALID [2018-11-23 12:13:30,973 INFO L273 TraceCheckUtils]: 82: Hoare triple {6303#false} assume !!(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,973 INFO L273 TraceCheckUtils]: 83: Hoare triple {6303#false} assume !(~i~1 > 2); {6303#false} is VALID [2018-11-23 12:13:30,974 INFO L273 TraceCheckUtils]: 84: Hoare triple {6303#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6303#false} is VALID [2018-11-23 12:13:30,974 INFO L273 TraceCheckUtils]: 85: Hoare triple {6303#false} assume !!(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,974 INFO L273 TraceCheckUtils]: 86: Hoare triple {6303#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6303#false} is VALID [2018-11-23 12:13:30,974 INFO L273 TraceCheckUtils]: 87: Hoare triple {6303#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6303#false} is VALID [2018-11-23 12:13:30,974 INFO L273 TraceCheckUtils]: 88: Hoare triple {6303#false} assume !!(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 89: Hoare triple {6303#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 90: Hoare triple {6303#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 91: Hoare triple {6303#false} assume !(~i~1 < 5); {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 92: Hoare triple {6303#false} 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); {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 93: Hoare triple {6303#false} assume true; {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {6303#false} {6303#false} #88#return; {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 95: Hoare triple {6303#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6303#false} is VALID [2018-11-23 12:13:30,975 INFO L273 TraceCheckUtils]: 96: Hoare triple {6303#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6303#false} is VALID [2018-11-23 12:13:30,976 INFO L273 TraceCheckUtils]: 97: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 12:13:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 12:13:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:31,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-23 12:13:31,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:31,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:31,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:31,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:31,053 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-11-23 12:13:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:31,488 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-23 12:13:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:31,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-23 12:13:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 12:13:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 12:13:31,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 12:13:31,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:31,618 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:13:31,618 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:13:31,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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 12:13:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:13:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:13:31,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:31,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:13:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:13:31,921 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:13:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:31,923 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-23 12:13:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 12:13:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:31,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:31,924 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:13:31,924 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:13:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:31,926 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-23 12:13:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 12:13:31,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:31,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:31,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:31,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:13:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-23 12:13:31,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 98 [2018-11-23 12:13:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:31,929 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-23 12:13:31,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 12:13:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:13:31,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:31,930 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 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 12:13:31,931 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:31,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614250, now seen corresponding path program 11 times [2018-11-23 12:13:31,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:31,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:31,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:31,943 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:31,943 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:31,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:31,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:32,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:13:32,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 12:13:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:13:33,142 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=9, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 5); VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] 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); VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #86#return; VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] RET #88#return; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [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); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [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); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [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 VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] ----- [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:13:33,452 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:13:33,453 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:13:33,454 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:13:33,455 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2018-11-23 12:13:33,456 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:13:33,457 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:13:33,457 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:13:33,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:13:33 BoogieIcfgContainer [2018-11-23 12:13:33,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:13:33,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:13:33,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:13:33,461 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:13:33,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:15" (3/4) ... [2018-11-23 12:13:33,464 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=9, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 5); VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] 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); VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #86#return; VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);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; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=4, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] RET #88#return; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [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); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [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); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [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; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [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; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [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); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=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); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [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; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [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; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [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); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [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 VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] ----- [2018-11-23 12:13:33,649 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 12:13:33,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:13:33,651 INFO L168 Benchmark]: Toolchain (without parser) took 19255.32 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -977.8 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:13:33,653 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:13:33,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:13:33,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:13:33,654 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:13:33,654 INFO L168 Benchmark]: RCFGBuilder took 1044.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -720.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:13:33,655 INFO L168 Benchmark]: TraceAbstraction took 17576.49 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -285.3 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:13:33,655 INFO L168 Benchmark]: Witness Printer took 188.99 ms. Allocated memory is still 2.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:13:33,657 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1044.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -720.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17576.49 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -285.3 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. * Witness Printer took 188.99 ms. Allocated memory is still 2.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [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 VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 17.4s OverallTime, 16 OverallIterations, 15 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 539 SDtfs, 50 SDslu, 824 SDs, 0 SdLazy, 157 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1048 ConstructedInterpolants, 0 QuantifiedInterpolants, 81768 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2648 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2275/2350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...