java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/xor5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:29:09,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:29:09,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:29:09,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:29:09,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:29:09,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:29:09,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:29:09,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:29:09,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:29:09,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:29:09,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:29:09,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:29:09,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:29:09,708 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:29:09,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:29:09,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:29:09,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:29:09,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:29:09,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:29:09,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:29:09,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:29:09,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:29:09,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:29:09,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:29:09,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:29:09,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:29:09,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:29:09,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:29:09,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:29:09,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:29:09,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:29:09,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:29:09,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:29:09,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:29:09,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:29:09,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:29:09,756 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:29:09,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:29:09,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:29:09,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:29:09,786 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:29:09,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:29:09,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:29:09,787 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:29:09,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:29:09,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:29:09,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:29:09,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:29:09,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:29:09,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:29:09,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:29:09,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:29:09,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:29:09,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:29:09,790 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:29:09,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:29:09,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:29:09,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:29:09,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:29:09,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:29:09,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:29:09,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:29:09,794 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:29:09,794 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:29:09,794 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:29:09,794 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:29:09,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:29:09,795 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:29:09,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:29:09,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:29:09,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:29:09,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:29:09,890 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:29:09,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor5_true-unreach-call.i [2018-11-23 12:29:09,960 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360d1486/df05e021db044464b315509c56b3c84a/FLAG23f4d16e4 [2018-11-23 12:29:10,478 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:29:10,479 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor5_true-unreach-call.i [2018-11-23 12:29:10,488 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360d1486/df05e021db044464b315509c56b3c84a/FLAG23f4d16e4 [2018-11-23 12:29:10,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360d1486/df05e021db044464b315509c56b3c84a [2018-11-23 12:29:10,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:29:10,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:29:10,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:29:10,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:29:10,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:29:10,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7646e791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10, skipping insertion in model container [2018-11-23 12:29:10,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:29:10,979 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:29:11,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:29:11,253 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:29:11,291 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:29:11,314 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:29:11,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11 WrapperNode [2018-11-23 12:29:11,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:29:11,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:29:11,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:29:11,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:29:11,328 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:29:11" (1/1) ... [2018-11-23 12:29:11,340 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:29:11" (1/1) ... [2018-11-23 12:29:11,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:29:11,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:29:11,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:29:11,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:29:11,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (1/1) ... [2018-11-23 12:29:11,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:29:11,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:29:11,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:29:11,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:29:11,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (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:29:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:29:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:29:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:29:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:29:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:29:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:29:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:29:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-23 12:29:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-23 12:29:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:29:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:29:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:29:12,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:29:12,172 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:29:12,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:12 BoogieIcfgContainer [2018-11-23 12:29:12,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:29:12,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:29:12,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:29:12,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:29:12,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:29:10" (1/3) ... [2018-11-23 12:29:12,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523d1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:12, skipping insertion in model container [2018-11-23 12:29:12,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:11" (2/3) ... [2018-11-23 12:29:12,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523d1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:12, skipping insertion in model container [2018-11-23 12:29:12,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:12" (3/3) ... [2018-11-23 12:29:12,182 INFO L112 eAbstractionObserver]: Analyzing ICFG xor5_true-unreach-call.i [2018-11-23 12:29:12,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:29:12,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:29:12,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:29:12,252 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:29:12,253 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:29:12,253 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:29:12,253 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:29:12,253 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:29:12,254 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:29:12,254 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:29:12,254 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:29:12,254 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:29:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:29:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:29:12,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:12,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:12,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:12,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1754504496, now seen corresponding path program 1 times [2018-11-23 12:29:12,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:12,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:12,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:12,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:29:12,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:29:12,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:12,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:29:12,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:29:12,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {34#true} is VALID [2018-11-23 12:29:12,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {34#true} is VALID [2018-11-23 12:29:12,533 INFO L256 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:12,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:12,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:29:12,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:29:12,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:29:12,548 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {34#true} #64#return; {35#false} is VALID [2018-11-23 12:29:12,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:29:12,549 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:12,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:12,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:29:12,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:29:12,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:12,551 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:29:12,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {35#false} is VALID [2018-11-23 12:29:12,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:29:12,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:29:12,552 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:12,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:12,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:29:12,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:29:12,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:12,554 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:29:12,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:29:12,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:29:12,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:29:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:29:12,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:12,565 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:29:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:12,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:29:12,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:29:12,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:12,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:29:12,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:29:12,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {34#true} is VALID [2018-11-23 12:29:12,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {34#true} is VALID [2018-11-23 12:29:12,985 INFO L256 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:12,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:13,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:29:13,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:29:13,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:29:13,004 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {34#true} #64#return; {35#false} is VALID [2018-11-23 12:29:13,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:29:13,005 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:29:13,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35#false} is VALID [2018-11-23 12:29:13,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:29:13,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:29:13,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:29:13,007 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:29:13,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {35#false} is VALID [2018-11-23 12:29:13,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:29:13,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:29:13,008 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:29:13,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35#false} is VALID [2018-11-23 12:29:13,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:29:13,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:29:13,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:29:13,010 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:29:13,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:29:13,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:29:13,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:29:13,013 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:29:13,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:29:13,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-23 12:29:13,051 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:29:13,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:13,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:29:13,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:13,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:29:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:29:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:29:13,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:29:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,388 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:29:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:29:13,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:29:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:29:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:29:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:29:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:29:13,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 12:29:13,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:13,700 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:29:13,701 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:29:13,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 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:29:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:29:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:29:13,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:13,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:29:13,878 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:29:13,878 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:29:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,888 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:29:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:29:13,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:13,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:13,889 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:29:13,889 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:29:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,895 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:29:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:29:13,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:13,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:13,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:13,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:29:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:29:13,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 32 [2018-11-23 12:29:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:13,902 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:29:13,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:29:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:29:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:29:13,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:13,904 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:13,905 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:13,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash 614035178, now seen corresponding path program 1 times [2018-11-23 12:29:13,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:13,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:13,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:13,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:13,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:14,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-23 12:29:14,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {285#true} is VALID [2018-11-23 12:29:14,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:29:14,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2018-11-23 12:29:14,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret12 := main(); {285#true} is VALID [2018-11-23 12:29:14,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {285#true} is VALID [2018-11-23 12:29:14,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {285#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:14,202 INFO L256 TraceCheckUtils]: 7: Hoare triple {287#(<= 2 ~N~0)} call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:29:14,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {288#(= xor_~i~0 1)} is VALID [2018-11-23 12:29:14,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {288#(= xor_~i~0 1)} assume !(~i~0 < ~N~0); {289#(<= ~N~0 1)} is VALID [2018-11-23 12:29:14,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {289#(<= ~N~0 1)} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {289#(<= ~N~0 1)} is VALID [2018-11-23 12:29:14,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#(<= ~N~0 1)} assume true; {289#(<= ~N~0 1)} is VALID [2018-11-23 12:29:14,219 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {289#(<= ~N~0 1)} {287#(<= 2 ~N~0)} #64#return; {286#false} is VALID [2018-11-23 12:29:14,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {286#false} is VALID [2018-11-23 12:29:14,220 INFO L256 TraceCheckUtils]: 14: Hoare triple {286#false} call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:29:14,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {285#true} is VALID [2018-11-23 12:29:14,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {285#true} assume !(~i~0 < ~N~0); {285#true} is VALID [2018-11-23 12:29:14,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {285#true} is VALID [2018-11-23 12:29:14,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:29:14,222 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {285#true} {286#false} #66#return; {286#false} is VALID [2018-11-23 12:29:14,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {286#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {286#false} is VALID [2018-11-23 12:29:14,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#false} assume !(~i~1 < ~N~0 - 1); {286#false} is VALID [2018-11-23 12:29:14,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {286#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {286#false} is VALID [2018-11-23 12:29:14,224 INFO L256 TraceCheckUtils]: 23: Hoare triple {286#false} call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); {285#true} is VALID [2018-11-23 12:29:14,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {285#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {285#true} is VALID [2018-11-23 12:29:14,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {285#true} assume !(~i~0 < ~N~0); {285#true} is VALID [2018-11-23 12:29:14,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {285#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {285#true} is VALID [2018-11-23 12:29:14,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:29:14,225 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {285#true} {286#false} #68#return; {286#false} is VALID [2018-11-23 12:29:14,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {286#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {286#false} is VALID [2018-11-23 12:29:14,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {286#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {286#false} is VALID [2018-11-23 12:29:14,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-23 12:29:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:29:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:14,229 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:14,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:14,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-23 12:29:14,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {285#true} is VALID [2018-11-23 12:29:14,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 12:29:14,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2018-11-23 12:29:14,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret12 := main(); {285#true} is VALID [2018-11-23 12:29:14,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {285#true} is VALID [2018-11-23 12:29:14,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {285#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:14,515 INFO L256 TraceCheckUtils]: 7: Hoare triple {287#(<= 2 ~N~0)} call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); {287#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:14,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {317#(and (<= 2 ~N~0) (<= xor_~i~0 1))} is VALID [2018-11-23 12:29:14,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {317#(and (<= 2 ~N~0) (<= xor_~i~0 1))} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:29:14,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:29:14,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:29:14,539 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {286#false} {287#(<= 2 ~N~0)} #64#return; {286#false} is VALID [2018-11-23 12:29:14,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {286#false} is VALID [2018-11-23 12:29:14,539 INFO L256 TraceCheckUtils]: 14: Hoare triple {286#false} call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 12:29:14,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {286#false} is VALID [2018-11-23 12:29:14,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {286#false} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:29:14,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:29:14,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:29:14,541 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {286#false} {286#false} #66#return; {286#false} is VALID [2018-11-23 12:29:14,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {286#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {286#false} is VALID [2018-11-23 12:29:14,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#false} assume !(~i~1 < ~N~0 - 1); {286#false} is VALID [2018-11-23 12:29:14,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {286#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {286#false} is VALID [2018-11-23 12:29:14,542 INFO L256 TraceCheckUtils]: 23: Hoare triple {286#false} call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 12:29:14,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {286#false} is VALID [2018-11-23 12:29:14,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {286#false} assume !(~i~0 < ~N~0); {286#false} is VALID [2018-11-23 12:29:14,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {286#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {286#false} is VALID [2018-11-23 12:29:14,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 12:29:14,544 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {286#false} {286#false} #68#return; {286#false} is VALID [2018-11-23 12:29:14,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {286#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {286#false} is VALID [2018-11-23 12:29:14,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {286#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {286#false} is VALID [2018-11-23 12:29:14,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-23 12:29:14,547 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:29:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:29:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-23 12:29:14,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:29:14,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:14,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:29:14,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:14,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:29:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:29:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:29:14,787 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 12:29:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:15,399 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 12:29:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:29:15,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:29:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:29:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:29:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:29:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:29:15,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 12:29:15,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:15,548 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:29:15,548 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:29:15,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:29:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:29:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:29:15,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:15,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:29:15,597 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:29:15,598 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:29:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:15,601 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:29:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:29:15,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:15,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:15,603 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:29:15,603 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:29:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:15,606 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:29:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:29:15,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:15,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:15,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:15,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:29:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 12:29:15,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 12:29:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:15,611 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 12:29:15,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:29:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:29:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:29:15,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:15,613 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:15,613 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:15,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 435243016, now seen corresponding path program 1 times [2018-11-23 12:29:15,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:15,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:15,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 12:29:15,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {540#true} is VALID [2018-11-23 12:29:15,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:29:15,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #60#return; {540#true} is VALID [2018-11-23 12:29:15,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret12 := main(); {540#true} is VALID [2018-11-23 12:29:15,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {540#true} is VALID [2018-11-23 12:29:15,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:15,743 INFO L256 TraceCheckUtils]: 7: Hoare triple {542#(<= 2 ~N~0)} call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:29:15,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {540#true} is VALID [2018-11-23 12:29:15,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {540#true} is VALID [2018-11-23 12:29:15,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {540#true} is VALID [2018-11-23 12:29:15,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {540#true} assume !(~i~0 < ~N~0); {540#true} is VALID [2018-11-23 12:29:15,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {540#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {540#true} is VALID [2018-11-23 12:29:15,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:29:15,747 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {540#true} {542#(<= 2 ~N~0)} #64#return; {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:15,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#(<= 2 ~N~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:15,747 INFO L256 TraceCheckUtils]: 16: Hoare triple {542#(<= 2 ~N~0)} call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:29:15,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {540#true} is VALID [2018-11-23 12:29:15,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {540#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {540#true} is VALID [2018-11-23 12:29:15,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {540#true} is VALID [2018-11-23 12:29:15,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {540#true} assume !(~i~0 < ~N~0); {540#true} is VALID [2018-11-23 12:29:15,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {540#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {540#true} is VALID [2018-11-23 12:29:15,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:29:15,750 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {540#true} {542#(<= 2 ~N~0)} #66#return; {542#(<= 2 ~N~0)} is VALID [2018-11-23 12:29:15,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#(<= 2 ~N~0)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {543#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-23 12:29:15,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {543#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {541#false} is VALID [2018-11-23 12:29:15,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {541#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {541#false} is VALID [2018-11-23 12:29:15,752 INFO L256 TraceCheckUtils]: 27: Hoare triple {541#false} call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); {540#true} is VALID [2018-11-23 12:29:15,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {540#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {540#true} is VALID [2018-11-23 12:29:15,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {540#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {540#true} is VALID [2018-11-23 12:29:15,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {540#true} is VALID [2018-11-23 12:29:15,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {540#true} assume !(~i~0 < ~N~0); {540#true} is VALID [2018-11-23 12:29:15,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {540#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {540#true} is VALID [2018-11-23 12:29:15,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 12:29:15,754 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {540#true} {541#false} #68#return; {541#false} is VALID [2018-11-23 12:29:15,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {541#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {541#false} is VALID [2018-11-23 12:29:15,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {541#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {541#false} is VALID [2018-11-23 12:29:15,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 12:29:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:29:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:29:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:29:15,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:29:15,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:15,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:29:15,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:15,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:29:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:29:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:29:15,880 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-23 12:29:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,040 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:29:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:29:16,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:29:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:29:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:29:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:29:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:29:16,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-23 12:29:16,127 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:29:16,129 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:29:16,130 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:29:16,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:29:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:29:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:29:16,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:16,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:16,157 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:16,157 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,160 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:29:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:29:16,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,161 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:29:16,162 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:29:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,164 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:29:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:29:16,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:16,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 12:29:16,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 38 [2018-11-23 12:29:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 12:29:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:29:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:29:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:29:16,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:16,172 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:16,172 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:16,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash 573397766, now seen corresponding path program 1 times [2018-11-23 12:29:16,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:29:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:29:16,347 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2147483657, |#NULL.offset|=2147483653, |old(#NULL.base)|=2147483657, |old(#NULL.offset)|=2147483653, |old(~N~0)|=2147483654, ~N~0=2147483654] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483657, |old(#NULL.offset)|=2147483653, |old(~N~0)|=2147483654, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483657, |old(#NULL.offset)|=2147483653, |old(~N~0)|=2147483654, ~N~0=0] [?] RET #60#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [xor_~i~0=1, xor_~res~0=2147483656, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; VAL [xor_~i~0=1, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [xor_~i~0=2, xor_~res~0=2147483652, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=(- 2147483644), ~N~0=2] [?] assume true; VAL [xor_~i~0=2, xor_~res~0=2147483652, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=(- 2147483644), ~N~0=2] [?] RET #64#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=(- 2147483644), |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [xor_~i~0=1, xor_~res~0=2147483656, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; VAL [xor_~i~0=1, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [xor_~i~0=2, xor_~res~0=2147483646, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=2147483646, ~N~0=2] [?] assume true; VAL [xor_~i~0=2, xor_~res~0=2147483646, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=2147483646, ~N~0=2] [?] RET #66#return; VAL [main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=2147483646, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; VAL [main_~i~1=0, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !!(~i~1 < ~N~0 - 1);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem10; VAL [main_~i~1=0, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !(~i~1 < ~N~0 - 1); VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [xor_~i~0=1, xor_~res~0=2147483656, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; VAL [xor_~i~0=1, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [xor_~i~0=2, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [xor_~i~0=2, xor_~res~0=2147483645, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=2147483645, ~N~0=2] [?] assume true; VAL [xor_~i~0=2, xor_~res~0=2147483645, xor_~x.base=2147483655, xor_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |xor_#in~x.base|=2147483655, |xor_#in~x.offset|=0, |xor_#res|=2147483645, ~N~0=2] [?] RET #68#return; VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=2147483645, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret5~0=2147483645, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret5~0=2147483645, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !false; VAL [main_~i~1=1, main_~ret2~0=2147483646, main_~ret5~0=2147483645, main_~ret~0=(- 2147483644), main_~temp~0=2147483656, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=2147483655, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483657, #NULL.offset=2147483653, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L6] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L22-L43] assume ~N~0 > 1; [L23] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x.base=2147483655, ~x.offset=0] [L29] RET call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L31] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L31] havoc #t~mem6; [L31] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x.base=2147483655, ~x.offset=0] [L32] RET call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] assume !!(~i~1 < ~N~0 - 1); [L35] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4); [L35] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4); [L35] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] assume !(~i~1 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x.base=2147483655, ~x.offset=0] [L38] RET call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40-L42] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483657, #NULL.offset=2147483653, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L6] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483657, old(#NULL.offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L22-L43] assume ~N~0 > 1; [L23] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x.base=2147483655, ~x.offset=0] [L29] RET call #t~ret4 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L31] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L31] havoc #t~mem6; [L31] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x.base=2147483655, ~x.offset=0] [L32] RET call #t~ret7 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] assume !!(~i~1 < ~N~0 - 1); [L35] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4); [L35] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4); [L35] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] assume !(~i~1 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=2147483655, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x.base=2147483655, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=2147483655, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x.base=2147483655, ~x.offset=0] [L38] RET call #t~ret11 := xor(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40-L42] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=2147483655, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483657, #NULL!offset=2147483653, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x!base=2147483655, ~x!offset=0] [L29] RET call #t~ret4 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x!base=2147483655, ~x!offset=0] [L32] RET call #t~ret7 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x!base=2147483655, ~x!offset=0] [L38] RET call #t~ret11 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483657, #NULL!offset=2147483653, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x!base=2147483655, ~x!offset=0] [L29] RET call #t~ret4 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x!base=2147483655, ~x!offset=0] [L32] RET call #t~ret7 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x!base=2147483655, ~x!offset=0] [L38] RET call #t~ret11 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483657, #NULL!offset=2147483653, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x!base=2147483655, ~x!offset=0] [L29] RET call #t~ret4 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x!base=2147483655, ~x!offset=0] [L32] RET call #t~ret7 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x!base=2147483655, ~x!offset=0] [L38] RET call #t~ret11 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483657, #NULL!offset=2147483653, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=2147483654] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483657, old(#NULL!offset)=2147483653, old(~N~0)=2147483654, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483652, ~x!base=2147483655, ~x!offset=0] [L29] RET call #t~ret4 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] CALL call #t~ret7 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483646, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483646, ~x!base=2147483655, ~x!offset=0] [L32] RET call #t~ret7 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=2147483646, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2147483644, ~temp~0=2147483656] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] CALL call #t~ret11 := xor(~#x~0); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=2147483656, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseXor(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=2147483655, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=2147483655, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483645, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483645, ~x!base=2147483655, ~x!offset=0] [L38] RET call #t~ret11 := xor(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483645, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret~0=-2147483644, ~temp~0=2147483656] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=2147483655, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=2147483646, ~ret5~0=2147483645, ~ret~0=-2147483644, ~temp~0=2147483656] [L6] int N; VAL [\old(N)=2147483654, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; VAL [\old(N)=0, N=2, x={2147483655:0}] [L29] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=2147483656, x={2147483655:0}, x={2147483655:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L16] return res; VAL [\old(N)=0, \result=-2147483644, i=2, N=2, res=2147483652, x={2147483655:0}, x={2147483655:0}] [L29] RET, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}, xor(x)=-2147483644] [L29] ret = xor(x) [L31] EXPR x[0] [L31] temp=x[0] [L31] EXPR x[1] [L31] x[0] = x[1] [L31] x[1] = temp VAL [\old(N)=0, N=2, ret=-2147483644, temp=2147483656, x={2147483655:0}] [L32] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=2147483656, x={2147483655:0}, x={2147483655:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L16] return res; VAL [\old(N)=0, \result=2147483646, i=2, N=2, res=2147483646, x={2147483655:0}, x={2147483655:0}] [L32] RET, EXPR xor(x) VAL [\old(N)=0, N=2, ret=-2147483644, temp=2147483656, x={2147483655:0}, xor(x)=2147483646] [L32] ret2 = xor(x) [L33] EXPR x[0] [L33] temp=x[0] [L34] int i =0 ; VAL [\old(N)=0, i=0, N=2, ret=-2147483644, ret2=2147483646, temp=2147483656, x={2147483655:0}] [L34] COND TRUE i 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; VAL [\old(N)=0, N=2, x={2147483655:0}] [L29] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=2147483656, x={2147483655:0}, x={2147483655:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L16] return res; VAL [\old(N)=0, \result=-2147483644, i=2, N=2, res=2147483652, x={2147483655:0}, x={2147483655:0}] [L29] RET, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}, xor(x)=-2147483644] [L29] ret = xor(x) [L31] EXPR x[0] [L31] temp=x[0] [L31] EXPR x[1] [L31] x[0] = x[1] [L31] x[1] = temp VAL [\old(N)=0, N=2, ret=-2147483644, temp=2147483656, x={2147483655:0}] [L32] CALL, EXPR xor(x) VAL [\old(N)=0, N=2, x={2147483655:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=2147483656, x={2147483655:0}, x={2147483655:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res ^ x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={2147483655:0}, x={2147483655:0}] [L16] return res; VAL [\old(N)=0, \result=2147483646, i=2, N=2, res=2147483646, x={2147483655:0}, x={2147483655:0}] [L32] RET, EXPR xor(x) VAL [\old(N)=0, N=2, ret=-2147483644, temp=2147483656, x={2147483655:0}, xor(x)=2147483646] [L32] ret2 = xor(x) [L33] EXPR x[0] [L33] temp=x[0] [L34] int i =0 ; VAL [\old(N)=0, i=0, N=2, ret=-2147483644, ret2=2147483646, temp=2147483656, x={2147483655:0}] [L34] COND TRUE i