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/xor1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:27:39,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:39,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:39,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:39,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:39,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:39,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:39,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:39,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:39,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:39,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:39,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:39,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:39,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:39,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:39,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:39,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:39,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:39,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:39,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:39,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:39,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:39,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:39,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:39,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:39,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:39,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:39,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:39,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:39,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:39,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:39,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:39,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:39,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:39,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:39,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:39,269 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:27:39,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:39,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:39,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:39,285 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:39,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:39,286 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:39,286 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:39,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:39,287 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:39,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:27:39,287 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:39,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:39,287 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:39,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:39,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:39,288 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:39,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:39,288 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:39,289 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:39,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:39,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:39,289 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:39,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:39,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:39,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:39,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:39,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:39,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:27:39,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:39,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:27:39,291 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:27:39,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:39,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:39,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:39,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:39,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:39,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor1_true-unreach-call.i [2018-11-23 12:27:39,434 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855d1e89/cea18f3412854d82b47f61cd156f96ee/FLAG6a0afc0f0 [2018-11-23 12:27:39,936 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:39,937 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor1_true-unreach-call.i [2018-11-23 12:27:39,946 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855d1e89/cea18f3412854d82b47f61cd156f96ee/FLAG6a0afc0f0 [2018-11-23 12:27:40,276 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855d1e89/cea18f3412854d82b47f61cd156f96ee [2018-11-23 12:27:40,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:40,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:40,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:40,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:40,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:40,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b3cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40, skipping insertion in model container [2018-11-23 12:27:40,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:40,332 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:40,587 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:40,598 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:40,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:40,644 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:40,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40 WrapperNode [2018-11-23 12:27:40,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:40,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:40,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:40,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:40,656 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:27:40" (1/1) ... [2018-11-23 12:27:40,667 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:27:40" (1/1) ... [2018-11-23 12:27:40,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:40,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:40,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:40,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:40,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (1/1) ... [2018-11-23 12:27:40,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:40,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:40,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:40,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:40,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (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:27:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:27:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:27:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-23 12:27:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-23 12:27:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:41,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:41,528 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:27:41,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:41 BoogieIcfgContainer [2018-11-23 12:27:41,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:41,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:41,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:41,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:41,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:40" (1/3) ... [2018-11-23 12:27:41,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e49e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:41, skipping insertion in model container [2018-11-23 12:27:41,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:40" (2/3) ... [2018-11-23 12:27:41,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e49e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:41, skipping insertion in model container [2018-11-23 12:27:41,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:41" (3/3) ... [2018-11-23 12:27:41,537 INFO L112 eAbstractionObserver]: Analyzing ICFG xor1_true-unreach-call.i [2018-11-23 12:27:41,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:41,553 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:41,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:41,604 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:41,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:41,605 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:41,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:41,607 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:41,607 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:41,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:41,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:41,608 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:27:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:41,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:41,636 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:27:41,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:41,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:41,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 12:27:41,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:41,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:41,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:27:41,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 12:27:41,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:41,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:27:41,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:27:41,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:27:41,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:27:41,878 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:41,878 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:27:41,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:27:41,879 INFO L273 TraceCheckUtils]: 10: 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:27:41,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:41,880 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:27:41,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:41,881 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:41,881 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:27:41,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:27:41,881 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:27:41,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:41,882 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:27:41,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {35#false} is VALID [2018-11-23 12:27:41,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:27:41,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:41,883 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:41,884 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:27:41,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:27:41,884 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:27:41,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:41,885 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:27:41,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {35#false} is VALID [2018-11-23 12:27:41,886 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:27:41,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:27:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:27:41,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:41,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:41,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:41,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:41,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:27:42,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:42,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:42,111 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:27:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,600 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:27:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:42,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:42,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:27:42,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:42,880 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:42,881 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:27:42,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:27:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:27:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:27:42,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:42,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:42,933 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:42,933 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,939 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:42,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,941 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:42,941 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,946 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:42,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:42,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:27:42,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:27:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:42,954 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:27:42,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:42,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:42,957 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:27:42,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:42,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 12:27:42,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:42,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:42,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:43,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:27:43,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-23 12:27:43,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:43,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:27:43,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:27:43,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:27:43,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 100); {199#false} is VALID [2018-11-23 12:27:43,074 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:43,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#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; {198#true} is VALID [2018-11-23 12:27:43,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:27:43,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:43,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:43,077 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:27:43,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:43,078 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:43,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#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; {198#true} is VALID [2018-11-23 12:27:43,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:27:43,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:43,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:43,079 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:27:43,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {199#false} is VALID [2018-11-23 12:27:43,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 99); {199#false} is VALID [2018-11-23 12:27:43,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:43,081 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:43,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#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; {198#true} is VALID [2018-11-23 12:27:43,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:27:43,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:43,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:43,082 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:27:43,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {199#false} is VALID [2018-11-23 12:27:43,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {199#false} is VALID [2018-11-23 12:27:43,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:27:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:27:43,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:43,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:43,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:43,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:43,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:43,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:43,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:43,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:43,181 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:27:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,740 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:27:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:43,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:43,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:27:43,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:43,858 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:43,858 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:27:43,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:27:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:27:43,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:43,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:43,878 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:43,878 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,881 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:43,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,883 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:43,883 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,886 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:43,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:43,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:27:43,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:27:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:43,891 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:27:43,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:27:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:27:43,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:43,893 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:43,893 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 12:27:43,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:44,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:27:44,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:44,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:44,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:27:44,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:44,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:27:44,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:27:44,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100); {362#true} is VALID [2018-11-23 12:27:44,022 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:44,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#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; {364#(= xor_~i~0 1)} is VALID [2018-11-23 12:27:44,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= xor_~i~0 1)} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:27:44,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:44,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:44,024 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:44,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:44,025 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:44,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#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; {362#true} is VALID [2018-11-23 12:27:44,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 100); {362#true} is VALID [2018-11-23 12:27:44,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:44,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:44,027 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:44,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:27:44,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99); {363#false} is VALID [2018-11-23 12:27:44,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:44,028 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:44,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#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; {362#true} is VALID [2018-11-23 12:27:44,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 100); {362#true} is VALID [2018-11-23 12:27:44,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:44,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:44,029 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:44,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:27:44,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:27:44,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:27:44,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:44,033 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:27:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:44,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:44,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:27:44,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:44,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:44,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:27:44,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:44,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:27:44,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:27:44,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100); {362#true} is VALID [2018-11-23 12:27:44,296 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:44,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#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; {398#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:44,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= xor_~i~0 1)} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:27:44,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:44,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:44,304 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:44,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:44,304 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:27:44,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#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; {363#false} is VALID [2018-11-23 12:27:44,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:27:44,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:44,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:44,305 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:44,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:27:44,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99); {363#false} is VALID [2018-11-23 12:27:44,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:44,307 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:27:44,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#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; {363#false} is VALID [2018-11-23 12:27:44,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:27:44,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:44,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:44,308 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:44,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:27:44,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:27:44,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:27:44,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:27:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:27:44,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:44,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:44,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:27:44,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:44,443 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:27:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,700 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:27:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:44,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:44,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:27:44,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:44,847 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:44,848 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:27:44,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:27:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:27:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:27:44,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:44,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:44,868 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:44,868 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,871 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:44,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:44,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:44,873 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:44,873 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,876 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:44,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:44,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:44,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:44,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:27:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:27:44,880 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:27:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:44,882 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:27:44,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:44,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:44,886 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:27:44,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:44,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2018-11-23 12:27:44,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:27:45,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-23 12:27:45,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:45,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:27:45,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:27:45,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:27:45,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {630#true} is VALID [2018-11-23 12:27:45,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {630#true} is VALID [2018-11-23 12:27:45,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 100); {630#true} is VALID [2018-11-23 12:27:45,015 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:45,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#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; {630#true} is VALID [2018-11-23 12:27:45,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:27:45,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:27:45,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:27:45,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:45,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:45,017 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:27:45,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:27:45,017 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:45,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#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; {630#true} is VALID [2018-11-23 12:27:45,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:27:45,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:27:45,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:27:45,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:45,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:45,019 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:27:45,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:27:45,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 99); {631#false} is VALID [2018-11-23 12:27:45,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:27:45,026 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:45,027 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#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; {630#true} is VALID [2018-11-23 12:27:45,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:27:45,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:27:45,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:27:45,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:45,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:45,028 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:27:45,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {631#false} is VALID [2018-11-23 12:27:45,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {631#false} is VALID [2018-11-23 12:27:45,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:27:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:45,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:45,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:45,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:45,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:45,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:45,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:45,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:45,111 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:27:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,204 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:27:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:45,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:45,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:27:45,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:45,347 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:27:45,348 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:27:45,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:27:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:27:45,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:45,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:45,371 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:45,371 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,376 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:45,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,377 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:45,377 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,383 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:45,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:45,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:27:45,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:27:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:45,390 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:27:45,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:27:45,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:45,392 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, 1, 1] [2018-11-23 12:27:45,392 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:45,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2018-11-23 12:27:45,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:45,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:45,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:45,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:27:45,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:45,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:45,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:27:45,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:45,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:45,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100); {800#false} is VALID [2018-11-23 12:27:45,515 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:45,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#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; {799#true} is VALID [2018-11-23 12:27:45,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:27:45,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:27:45,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:27:45,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:45,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:45,518 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:45,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:45,518 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:45,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#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; {799#true} is VALID [2018-11-23 12:27:45,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:27:45,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:27:45,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:27:45,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:45,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:45,520 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:45,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:27:45,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:27:45,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:27:45,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99); {800#false} is VALID [2018-11-23 12:27:45,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:45,522 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:45,522 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#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; {799#true} is VALID [2018-11-23 12:27:45,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:27:45,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:27:45,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:27:45,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:45,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:45,524 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:45,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:27:45,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:27:45,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:45,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:45,528 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:27:45,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:45,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:45,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:45,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:27:45,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:45,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:45,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100); {800#false} is VALID [2018-11-23 12:27:45,892 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:45,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#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; {800#false} is VALID [2018-11-23 12:27:45,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:27:45,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:27:45,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:27:45,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:45,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:45,895 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:45,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:45,896 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:45,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#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; {800#false} is VALID [2018-11-23 12:27:45,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:27:45,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:27:45,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:27:45,897 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:45,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:45,897 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:45,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:27:45,898 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:27:45,898 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:27:45,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99); {800#false} is VALID [2018-11-23 12:27:45,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:45,899 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:45,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#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; {800#false} is VALID [2018-11-23 12:27:45,899 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:27:45,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:27:45,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:27:45,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:45,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:45,900 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:45,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:27:45,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:27:45,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:45,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:45,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:27:45,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:45,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:45,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:27:46,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:46,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:46,007 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:27:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:46,221 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:27:46,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:46,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:46,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:27:46,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:46,304 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:46,304 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:27:46,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:27:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:27:46,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:46,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:46,385 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:46,385 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:46,387 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:46,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:46,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:46,388 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:46,388 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:46,390 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:46,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:46,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:46,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:46,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:27:46,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:27:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:46,394 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:27:46,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:27:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:27:46,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:46,395 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:46,396 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:46,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2018-11-23 12:27:46,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:46,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:46,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:46,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:46,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:27:46,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:46,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:46,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:27:46,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100); {1115#false} is VALID [2018-11-23 12:27:46,668 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:46,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#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; {1114#true} is VALID [2018-11-23 12:27:46,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:27:46,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:27:46,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:27:46,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:46,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:46,670 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:46,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:46,671 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:46,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#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; {1114#true} is VALID [2018-11-23 12:27:46,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:27:46,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:27:46,671 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:27:46,672 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:46,672 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:46,672 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:46,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:27:46,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:27:46,673 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:27:46,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99); {1115#false} is VALID [2018-11-23 12:27:46,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:46,673 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:46,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#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; {1114#true} is VALID [2018-11-23 12:27:46,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:27:46,674 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:27:46,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:27:46,674 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:46,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:46,675 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:46,675 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:27:46,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:27:46,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:46,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:46,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:46,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:46,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:46,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:46,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:27:46,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:46,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:46,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:27:46,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:46,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:46,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100); {1115#false} is VALID [2018-11-23 12:27:46,848 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:46,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#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; {1115#false} is VALID [2018-11-23 12:27:46,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:27:46,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:27:46,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:27:46,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:46,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:46,850 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:46,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:46,851 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:46,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#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; {1115#false} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:27:46,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:27:46,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99); {1115#false} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:46,854 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#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; {1115#false} is VALID [2018-11-23 12:27:46,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:46,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:46,856 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:46,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:27:46,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:27:46,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:27:46,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:46,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:46,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:27:46,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:46,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:27:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:27:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:46,937 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:27:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,103 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:27:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:47,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:47,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:27:47,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:47,232 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:47,232 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:27:47,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:27:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:27:47,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:47,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:47,352 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:47,352 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,355 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,356 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:47,356 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,358 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:47,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:47,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:27:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:27:47,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:27:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:47,361 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:27:47,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:27:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:27:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:27:47,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:47,363 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:47,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:47,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2018-11-23 12:27:47,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:47,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:47,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:47,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:27:47,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:47,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:27:47,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:47,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:47,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:47,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:47,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:47,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:47,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:47,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 100); {1447#false} is VALID [2018-11-23 12:27:47,568 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:27:47,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:27:47,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:27:47,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:27:47,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:47,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,571 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:27:47,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:47,571 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:27:47,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:27:47,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:27:47,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:27:47,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:47,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,573 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:27:47,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:27:47,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1447#false} is VALID [2018-11-23 12:27:47,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1447#false} is VALID [2018-11-23 12:27:47,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 99); {1447#false} is VALID [2018-11-23 12:27:47,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:47,575 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:27:47,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:27:47,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:27:47,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:27:47,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:47,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,577 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:27:47,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:27:47,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:27:47,577 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:27:47,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:47,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:47,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:27:47,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:47,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:47,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:27:47,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:47,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:27:47,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:27:47,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:27:47,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:27:47,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:27:47,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:27:47,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:27:47,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:27:47,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 100); {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:27:47,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:27:47,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:27:47,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:27:47,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1446#true} is VALID [2018-11-23 12:27:47,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1446#true} is VALID [2018-11-23 12:27:47,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 99); {1446#true} is VALID [2018-11-23 12:27:47,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:47,822 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:47,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#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; {1563#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:47,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1563#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:47,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1570#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:47,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= xor_~i~0 2)} assume !(~i~0 < 100); {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:27:47,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:27:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:27:47,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:47,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:47,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:47,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:47,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:47,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:47,953 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:27:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,215 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:27:48,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:48,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:48,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:27:48,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:48,329 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:48,329 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:27:48,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:27:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:27:48,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:48,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:48,377 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:48,377 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,379 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:48,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,380 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:48,380 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,382 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:48,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:48,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:27:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:27:48,386 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:27:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:48,386 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:27:48,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:27:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:27:48,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:48,387 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:48,387 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:48,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2018-11-23 12:27:48,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:48,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:48,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:27:48,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:48,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:48,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:27:48,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:48,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:48,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:48,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:48,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:48,596 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:48,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:48,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:48,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:48,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100); {1810#false} is VALID [2018-11-23 12:27:48,602 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#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; {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:27:48,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:48,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:48,604 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:48,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:48,604 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:48,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#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; {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:27:48,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:48,606 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:48,606 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:48,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:27:48,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:27:48,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:27:48,606 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99); {1810#false} is VALID [2018-11-23 12:27:48,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:48,607 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:48,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#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; {1809#true} is VALID [2018-11-23 12:27:48,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:27:48,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:27:48,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:27:48,608 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:48,608 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:48,608 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:48,608 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:27:48,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:27:48,609 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:27:48,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:48,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:48,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:48,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:48,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:48,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:48,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:27:48,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:48,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:48,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:27:48,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:48,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:48,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:48,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:48,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:48,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:48,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:48,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:48,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:48,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100); {1810#false} is VALID [2018-11-23 12:27:48,978 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:48,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#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; {1810#false} is VALID [2018-11-23 12:27:48,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:27:48,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:48,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:48,980 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:48,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:48,981 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:48,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#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; {1810#false} is VALID [2018-11-23 12:27:48,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:27:48,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:48,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:48,984 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:48,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:27:48,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:27:48,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:27:48,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99); {1810#false} is VALID [2018-11-23 12:27:48,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:48,985 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:48,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#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; {1810#false} is VALID [2018-11-23 12:27:48,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:27:48,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:27:48,986 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:27:48,987 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:27:49,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:49,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:27:49,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:49,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:49,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:49,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:49,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:49,069 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:27:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,322 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:27:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:49,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:49,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:27:49,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:49,453 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:27:49,454 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:49,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:27:49,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:49,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:49,472 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:49,472 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,475 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:49,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,476 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:49,476 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,478 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:49,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:49,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:27:49,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:27:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:49,481 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:27:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:27:49,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:49,482 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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:27:49,482 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:49,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2018-11-23 12:27:49,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:49,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:49,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:27:49,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:49,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:49,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:27:49,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2213#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 100); {2207#false} is VALID [2018-11-23 12:27:49,654 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:49,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#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; {2206#true} is VALID [2018-11-23 12:27:49,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:27:49,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:49,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:49,656 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:27:49,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:49,656 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:49,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#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; {2206#true} is VALID [2018-11-23 12:27:49,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:27:49,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:49,658 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99); {2207#false} is VALID [2018-11-23 12:27:49,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:49,659 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#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; {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:27:49,659 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:27:49,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:49,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:49,660 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:49,660 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:27:49,660 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:27:49,660 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:27:49,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:49,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:49,671 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:49,722 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:27:49,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:49,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:49,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:27:49,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:27:49,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 100); {2206#true} is VALID [2018-11-23 12:27:49,882 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:49,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#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; {2271#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:49,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2271#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:49,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2278#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:49,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2278#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:49,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2285#(<= xor_~i~0 3)} is VALID [2018-11-23 12:27:49,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= xor_~i~0 3)} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:27:49,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:49,885 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:49,885 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#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; {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:27:49,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:27:49,887 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:27:49,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:27:49,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:49,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:49,887 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:49,888 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:27:49,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:27:49,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:27:49,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99); {2207#false} is VALID [2018-11-23 12:27:49,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:49,889 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:27:49,889 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#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; {2207#false} is VALID [2018-11-23 12:27:49,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:27:49,890 INFO L273 TraceCheckUtils]: 46: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:27:49,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:27:49,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:27:49,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:27:49,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:49,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:49,891 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:49,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:27:49,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:27:49,891 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:27:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:27:49,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:49,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:49,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:50,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:50,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:50,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:50,114 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:27:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,691 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:27:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:50,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:50,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:27:50,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:50,781 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:27:50,781 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:50,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:27:50,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:50,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:50,800 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:50,800 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,803 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:50,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:50,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:50,804 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:50,804 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,806 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:50,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:50,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:50,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:50,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:27:50,808 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:27:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:50,808 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:27:50,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:27:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:27:50,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:50,810 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 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:27:50,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:50,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:50,810 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2018-11-23 12:27:50,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:50,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:50,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:51,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:27:51,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:51,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:27:51,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {2642#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2643#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 100); {2636#false} is VALID [2018-11-23 12:27:51,075 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:51,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:27:51,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,076 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:27:51,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:51,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,077 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:27:51,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {2636#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:51,077 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,079 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {2636#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2636#false} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2636#false} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {2636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2636#false} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 99); {2636#false} is VALID [2018-11-23 12:27:51,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:51,080 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,081 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:27:51,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:27:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:51,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:51,125 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:27:51,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:51,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:51,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:27:51,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:51,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:27:51,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:27:51,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 100); {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,278 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:51,280 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:51,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {2779#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:51,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 99); {2636#false} is VALID [2018-11-23 12:27:51,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:51,282 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {2636#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; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:27:51,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 100); {2636#false} is VALID [2018-11-23 12:27:51,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:27:51,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:27:51,284 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:51,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:27:51,285 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:27:51,285 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:27:51,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:51,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:27:51,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:51,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:51,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:51,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:51,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:51,447 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:27:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,723 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:27:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:51,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:51,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:27:51,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:51,850 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:27:51,851 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:51,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:51,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:51,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:51,878 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:51,879 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,881 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:51,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,881 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:51,881 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:51,886 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:51,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:51,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:51,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:51,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:27:51,888 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:27:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:51,888 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:27:51,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:27:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:27:51,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:51,889 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:51,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:51,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2018-11-23 12:27:51,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:51,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:52,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:27:52,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:52,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:52,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:27:52,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:52,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:52,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {3113#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:52,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:52,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:52,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:52,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:52,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:52,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:52,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:52,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:52,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:52,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:52,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:52,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:52,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100); {3112#false} is VALID [2018-11-23 12:27:52,225 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:52,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {3111#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; {3111#true} is VALID [2018-11-23 12:27:52,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:27:52,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:52,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:52,227 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:52,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:52,227 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:52,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {3111#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; {3111#true} is VALID [2018-11-23 12:27:52,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:27:52,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:52,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:52,230 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:52,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:27:52,230 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:27:52,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:27:52,231 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:27:52,231 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:27:52,231 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99); {3112#false} is VALID [2018-11-23 12:27:52,231 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:52,231 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:52,231 INFO L273 TraceCheckUtils]: 54: Hoare triple {3111#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; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 58: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:27:52,232 INFO L273 TraceCheckUtils]: 60: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:27:52,233 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:27:52,233 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:52,233 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:52,233 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:52,233 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:27:52,233 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:27:52,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:27:52,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:52,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:52,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:52,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:52,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:52,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:27:52,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:52,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:52,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:27:52,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:52,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:52,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:52,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:52,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:52,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:52,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:52,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:52,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:52,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:52,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:52,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:52,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:52,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:52,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:52,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100); {3112#false} is VALID [2018-11-23 12:27:52,444 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:52,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {3112#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; {3112#false} is VALID [2018-11-23 12:27:52,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:27:52,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:52,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:52,446 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:52,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:52,446 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {3112#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; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 37: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 39: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:27:52,448 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99); {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 54: Hoare triple {3112#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; {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,449 INFO L273 TraceCheckUtils]: 58: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:27:52,450 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:27:52,451 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:27:52,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:52,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:52,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:52,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:52,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:52,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:52,616 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,866 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:52,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:52,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:52,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:52,943 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:52,943 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:52,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:52,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:52,967 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:52,968 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,969 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:52,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,969 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:52,969 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,971 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:52,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:52,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:52,973 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:52,974 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:52,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:52,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:52,975 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:52,975 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:52,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2018-11-23 12:27:52,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:52,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:53,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:27:53,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:53,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:53,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:27:53,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {3611#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:53,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100); {3610#false} is VALID [2018-11-23 12:27:53,201 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:53,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {3609#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; {3609#true} is VALID [2018-11-23 12:27:53,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:27:53,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:53,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:53,203 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:53,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:53,204 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:53,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#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; {3609#true} is VALID [2018-11-23 12:27:53,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:27:53,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:53,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:53,206 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:53,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:27:53,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:27:53,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:27:53,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:27:53,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:27:53,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99); {3610#false} is VALID [2018-11-23 12:27:53,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:53,208 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:53,208 INFO L273 TraceCheckUtils]: 56: Hoare triple {3609#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; {3609#true} is VALID [2018-11-23 12:27:53,208 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,208 INFO L273 TraceCheckUtils]: 58: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,208 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,208 INFO L273 TraceCheckUtils]: 60: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:53,209 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:53,209 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:27:53,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:27:53,210 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:27:53,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:53,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:53,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:53,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:53,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:53,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:27:53,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:53,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:53,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:27:53,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:53,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:53,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {3638#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:53,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100); {3610#false} is VALID [2018-11-23 12:27:53,578 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:53,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {3610#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; {3610#false} is VALID [2018-11-23 12:27:53,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:53,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {3610#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; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:27:53,581 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99); {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {3610#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; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 60: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:53,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:27:53,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:27:53,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:27:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:53,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:53,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:53,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:53,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:53,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:53,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:53,680 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:53,887 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:53,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:53,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:53,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:53,980 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:53,980 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:53,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:54,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:54,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:54,009 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:54,009 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,011 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:54,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,012 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:54,012 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,014 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:54,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:54,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:54,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:54,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:54,017 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:54,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:54,018 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:54,018 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:54,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2018-11-23 12:27:54,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:54,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:54,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:27:54,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:54,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:27:54,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:54,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:54,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {4126#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:54,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:54,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {4127#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:54,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:54,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {4128#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:54,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:54,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {4129#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:54,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:54,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {4130#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:54,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:54,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {4131#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:54,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:54,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:54,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:54,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:54,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:54,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4135#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:54,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 100); {4125#false} is VALID [2018-11-23 12:27:54,267 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:54,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:27:54,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:27:54,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:54,269 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,270 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:54,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {4125#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:54,270 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:54,270 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:27:54,270 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,271 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,271 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,271 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,272 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {4125#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4125#false} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 52: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:27:54,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 99); {4125#false} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:54,273 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 60: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,274 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:27:54,274 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:27:54,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:27:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:54,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:54,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:54,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:54,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:54,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:54,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:54,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:27:54,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:54,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:27:54,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:54,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 100); {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:27:54,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:27:54,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {4124#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:27:54,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:27:54,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:54,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:54,533 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:54,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {4124#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:54,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:54,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {4289#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:54,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:54,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4303#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:54,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 99); {4125#false} is VALID [2018-11-23 12:27:54,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:54,536 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:27:54,536 INFO L273 TraceCheckUtils]: 58: Hoare triple {4125#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; {4125#false} is VALID [2018-11-23 12:27:54,537 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:27:54,537 INFO L273 TraceCheckUtils]: 60: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:27:54,537 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:27:54,537 INFO L273 TraceCheckUtils]: 62: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:27:54,538 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:27:54,538 INFO L273 TraceCheckUtils]: 64: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:27:54,538 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 100); {4125#false} is VALID [2018-11-23 12:27:54,538 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:27:54,539 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:54,539 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:54,539 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:27:54,539 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:27:54,539 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-23 12:27:54,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:54,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:54,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:54,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:54,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:54,653 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:27:54,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:54,655 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,120 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:55,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:55,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:55,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:55,225 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:55,225 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:55,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:55,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:55,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:55,253 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:55,254 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,255 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:55,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,256 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:55,256 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,258 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:55,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:55,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:55,260 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:55,261 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:55,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:55,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:55,262 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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:27:55,262 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:55,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2018-11-23 12:27:55,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:55,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:55,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:27:55,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:55,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:55,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:27:55,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:55,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:55,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:55,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:55,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:55,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:55,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {4675#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:55,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:55,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {4676#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:55,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:55,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:55,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:55,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:55,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:55,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:55,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:55,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:55,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:55,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:55,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:55,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:55,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 100); {4672#false} is VALID [2018-11-23 12:27:55,867 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:55,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:27:55,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,868 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:27:55,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:55,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:55,869 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:55,870 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,870 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:55,871 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {4672#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4672#false} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:27:55,871 INFO L273 TraceCheckUtils]: 54: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 99); {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:55,872 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 66: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 68: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:55,873 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:55,874 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:55,874 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:27:55,874 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:27:55,874 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-23 12:27:55,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:55,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:55,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:55,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:55,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:55,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:56,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:56,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:27:56,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:56,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:56,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:27:56,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:56,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 100); {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:27:56,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:56,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {4671#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {4671#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:27:56,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 56: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 58: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 99); {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:56,116 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:56,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#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; {4873#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:56,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4873#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:56,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4880#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:56,118 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4880#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:56,118 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4887#(<= xor_~i~0 3)} is VALID [2018-11-23 12:27:56,119 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4887#(<= xor_~i~0 3)} is VALID [2018-11-23 12:27:56,119 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4894#(<= xor_~i~0 4)} is VALID [2018-11-23 12:27:56,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= xor_~i~0 4)} assume !(~i~0 < 100); {4672#false} is VALID [2018-11-23 12:27:56,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:27:56,120 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:56,121 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:56,121 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:27:56,121 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:27:56,121 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 12:27:56,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:56,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:56,144 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:56,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:56,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:56,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:56,211 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,667 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:56,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:56,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:56,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:56,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:56,775 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:56,775 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:56,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:56,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:56,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:56,799 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:56,799 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,800 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:56,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,801 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:56,801 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,803 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:56,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:56,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:56,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:56,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:56,805 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:56,806 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:56,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:56,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:56,807 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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:27:56,807 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:56,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2018-11-23 12:27:56,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:57,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:57,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:27:57,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:57,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:57,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:27:57,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:57,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:57,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:57,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:57,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:57,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:57,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:57,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {5260#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:57,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {5261#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:57,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:57,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {5262#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:57,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:57,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {5263#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:57,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:57,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {5264#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:57,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:57,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {5265#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:57,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:57,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {5266#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:57,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:57,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5268#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 100); {5256#false} is VALID [2018-11-23 12:27:57,184 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#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; {5255#true} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:57,185 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:57,186 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {5255#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; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 49: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:57,187 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:27:57,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99); {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:57,188 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:57,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {5255#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; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:27:57,189 INFO L273 TraceCheckUtils]: 76: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:57,190 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:27:57,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:27:57,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:57,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:57,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:57,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:57,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:57,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:57,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:27:57,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:57,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:57,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:27:57,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:57,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:27:57,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:27:57,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 100); {5255#true} is VALID [2018-11-23 12:27:57,606 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:57,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#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; {5362#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:57,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5362#(<= xor_~i~0 1)} is VALID [2018-11-23 12:27:57,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5369#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:57,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5369#(<= xor_~i~0 2)} is VALID [2018-11-23 12:27:57,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5376#(<= xor_~i~0 3)} is VALID [2018-11-23 12:27:57,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5376#(<= xor_~i~0 3)} is VALID [2018-11-23 12:27:57,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5383#(<= xor_~i~0 4)} is VALID [2018-11-23 12:27:57,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5383#(<= xor_~i~0 4)} is VALID [2018-11-23 12:27:57,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#(<= xor_~i~0 5)} is VALID [2018-11-23 12:27:57,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= xor_~i~0 5)} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:27:57,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:57,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:57,611 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:57,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:57,611 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:57,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {5256#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; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,613 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,613 INFO L273 TraceCheckUtils]: 53: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,613 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:27:57,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:57,613 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:27:57,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99); {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 68: Hoare triple {5256#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; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 70: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:57,616 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:57,617 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:57,617 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:27:57,617 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:27:57,617 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-23 12:27:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:57,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:57,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:57,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:57,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:57,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:57,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:57,740 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:58,216 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:58,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:58,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:59,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:59,362 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:59,362 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:59,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:59,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:59,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:59,979 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:59,980 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:59,981 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:59,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:59,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:59,982 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:59,982 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:59,984 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:59,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:59,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:59,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:59,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:59,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:59,987 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:59,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:59,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:59,989 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 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:27:59,989 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:59,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:59,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2018-11-23 12:27:59,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:59,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:59,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:59,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:00,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:28:00,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:28:00,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:00,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:28:00,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:28:00,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:28:00,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:28:00,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {5890#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:00,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:00,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {5891#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:00,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:00,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {5892#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:00,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:00,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {5893#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:00,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:00,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {5894#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:00,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:00,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {5895#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:00,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:00,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {5896#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:00,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:00,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {5897#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:00,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:00,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {5898#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:00,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:00,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {5899#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:00,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:00,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:00,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:00,647 INFO L273 TraceCheckUtils]: 29: Hoare triple {5901#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5902#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:00,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 100); {5889#false} is VALID [2018-11-23 12:28:00,648 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:28:00,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:28:00,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,649 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:28:00,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:28:00,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:00,651 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:28:00,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {5889#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:28:00,652 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:28:00,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:28:00,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:28:00,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:00,654 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {5889#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 66: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 68: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:28:00,654 INFO L273 TraceCheckUtils]: 70: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 99); {5889#false} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:28:00,655 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,655 INFO L273 TraceCheckUtils]: 78: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:28:00,656 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:00,657 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:28:00,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:28:00,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:28:00,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:28:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-23 12:28:00,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:00,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:00,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:00,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:28:00,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:00,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:01,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:28:01,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,008 INFO L273 TraceCheckUtils]: 23: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 100); {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:28:01,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 47: Hoare triple {5888#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:28:01,011 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,012 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:28:01,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:28:01,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:28:01,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:28:01,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:01,013 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:28:01,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {5888#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:01,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:01,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {6098#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:01,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:01,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {6105#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:01,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:01,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {6112#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6119#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:01,016 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 99); {5889#false} is VALID [2018-11-23 12:28:01,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 74: Hoare triple {5889#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; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 78: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:28:01,017 INFO L273 TraceCheckUtils]: 80: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 82: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 84: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 100); {5889#false} is VALID [2018-11-23 12:28:01,018 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:28:01,019 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:28:01,019 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:28:01,019 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:28:01,019 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:28:01,019 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:28:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-23 12:28:01,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:01,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:28:01,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:28:01,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:01,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:28:01,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:01,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:28:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:28:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:28:01,120 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:28:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:01,708 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:28:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:28:01,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:28:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:28:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:28:01,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:28:02,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:02,187 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:28:02,188 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:28:02,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:28:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:28:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:28:02,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:02,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:02,219 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:02,219 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,221 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:28:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:28:02,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,222 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:28:02,222 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:28:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,224 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:28:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:28:02,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:02,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:28:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:28:02,227 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:28:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:02,228 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:28:02,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:28:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:28:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:28:02,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:02,229 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:02,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:02,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2018-11-23 12:28:02,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:28:03,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:28:03,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:03,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:28:03,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:28:03,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:28:03,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:28:03,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {6570#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:03,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100); {6569#false} is VALID [2018-11-23 12:28:03,140 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:28:03,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {6568#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; {6568#true} is VALID [2018-11-23 12:28:03,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:28:03,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:28:03,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:03,143 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:28:03,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:03,143 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:28:03,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {6568#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; {6568#true} is VALID [2018-11-23 12:28:03,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:03,145 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99); {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:03,146 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#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; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,147 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:03,148 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:28:03,148 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:28:03,149 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:28:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:28:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:03,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:03,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:28:03,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:28:03,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:03,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:28:03,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:28:03,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:03,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:03,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {6602#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,658 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:03,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100); {6569#false} is VALID [2018-11-23 12:28:03,670 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:28:03,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {6569#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; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:03,672 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L273 TraceCheckUtils]: 51: Hoare triple {6569#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; {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,674 INFO L273 TraceCheckUtils]: 61: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:28:03,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99); {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {6569#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; {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:28:03,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:28:03,679 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:28:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:28:03,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:03,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:28:03,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:28:03,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:03,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:28:03,824 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:28:03,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:28:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:28:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:28:03,825 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:28:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,548 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:28:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:28:04,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:28:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:28:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:28:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:28:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:28:04,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:28:05,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:05,045 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:28:05,045 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:28:05,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:28:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:28:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:28:05,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:05,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:28:05,074 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:28:05,074 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:28:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,077 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:28:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:28:05,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,078 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:28:05,078 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:28:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,080 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:28:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:28:05,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:05,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:28:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:28:05,083 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:28:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:05,083 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:28:05,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:28:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:28:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:28:05,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:05,084 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:05,085 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:05,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2018-11-23 12:28:05,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:05,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:05,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:28:05,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:28:05,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:28:05,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:28:05,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {7270#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:05,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:05,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:05,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:05,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:05,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:05,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:05,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:05,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:05,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:05,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:05,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:05,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:05,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:05,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:05,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:05,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:05,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:05,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:05,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:05,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:05,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:05,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:05,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:05,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100); {7269#false} is VALID [2018-11-23 12:28:05,889 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:28:05,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {7268#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; {7268#true} is VALID [2018-11-23 12:28:05,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:28:05,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:28:05,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:28:05,892 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:28:05,893 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {7268#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; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:28:05,894 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:28:05,894 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:05,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99); {7269#false} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:28:05,896 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 80: Hoare triple {7268#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; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 82: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 84: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,896 INFO L273 TraceCheckUtils]: 86: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 88: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 90: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:28:05,897 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:28:05,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:28:05,898 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:28:05,898 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:28:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:28:05,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:05,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:05,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:05,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:05,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:06,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:28:06,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:28:06,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:28:06,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:28:06,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:28:06,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:06,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:06,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {7303#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:06,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:06,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:06,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:06,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:06,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:06,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:06,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:06,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:06,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:06,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:06,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:06,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:06,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:06,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:06,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:06,202 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:06,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:06,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:06,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:06,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:06,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:06,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:06,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:06,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:06,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:06,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:06,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100); {7269#false} is VALID [2018-11-23 12:28:06,210 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:28:06,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#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; {7269#false} is VALID [2018-11-23 12:28:06,210 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,210 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,211 INFO L273 TraceCheckUtils]: 40: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,211 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:28:06,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:28:06,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:28:06,213 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:28:06,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:28:06,213 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:28:06,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {7269#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; {7269#false} is VALID [2018-11-23 12:28:06,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:28:06,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:06,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99); {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {7269#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; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 88: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:28:06,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:28:06,219 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:28:06,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:28:06,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:28:06,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:28:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:28:06,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:28:06,243 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:28:06,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:06,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:28:06,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:28:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:28:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:28:06,312 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:28:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:06,739 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:28:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:28:06,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:28:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:28:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:28:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:28:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:28:06,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:28:07,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:07,164 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:28:07,164 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:28:07,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:28:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:28:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:28:07,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:07,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:28:07,200 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:28:07,200 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:28:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:07,203 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:28:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:28:07,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:07,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:07,204 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:28:07,204 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:28:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:07,207 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:28:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:28:07,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:07,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:07,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:07,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:28:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:28:07,210 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:28:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:07,211 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:28:07,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:28:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:28:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:28:07,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:07,212 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:07,212 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:07,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2018-11-23 12:28:07,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:07,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:07,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:08,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:28:08,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:28:08,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:08,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:28:08,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:28:08,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:28:08,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:28:08,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {7987#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:08,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:08,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {7988#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:08,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:08,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {7989#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:08,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:08,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {7990#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:08,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:08,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {7991#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:08,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:08,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {7992#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:08,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:08,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:08,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:08,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {7994#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:08,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:08,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {7995#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:08,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:08,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {7996#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:08,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:08,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {7997#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:08,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:08,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {7998#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:08,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:08,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {7999#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:08,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:08,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {8000#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:08,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:08,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {8001#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8002#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:08,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 100); {7986#false} is VALID [2018-11-23 12:28:08,844 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:08,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:28:08,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,845 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 53: Hoare triple {7986#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:28:08,846 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:28:08,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,847 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:08,848 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 70: Hoare triple {7986#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7986#false} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 72: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:28:08,848 INFO L273 TraceCheckUtils]: 74: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 76: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 78: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 99); {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:28:08,849 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:08,849 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,850 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:08,851 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:28:08,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:28:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:28:08,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:08,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:08,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:28:08,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:08,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:09,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:09,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:28:09,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:28:09,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 100); {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:09,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:09,206 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:28:09,208 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 99); {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:28:09,209 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:28:09,210 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#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; {8252#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:09,210 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8252#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:09,211 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8259#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:09,211 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8259#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:09,211 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8266#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:09,212 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8266#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:09,212 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8273#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:09,212 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8273#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:09,213 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8280#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:09,213 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8280#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:09,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8287#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:09,214 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= xor_~i~0 6)} assume !(~i~0 < 100); {7986#false} is VALID [2018-11-23 12:28:09,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:28:09,214 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:28:09,214 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:28:09,214 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:28:09,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:28:09,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:28:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-23 12:28:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:09,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:28:09,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:28:09,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:09,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:28:09,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:09,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:28:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:28:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:28:09,319 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:28:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,672 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:28:09,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:28:09,672 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:28:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:28:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:28:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:28:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:28:09,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:28:10,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:10,317 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:28:10,317 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:28:10,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:28:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:28:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:28:10,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:10,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:28:10,348 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:28:10,348 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:28:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,353 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:28:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:28:10,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,354 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:28:10,354 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:28:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,356 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:28:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:28:10,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:10,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:28:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:28:10,360 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:28:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:10,360 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:28:10,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:28:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:28:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:28:10,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:10,362 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:10,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:10,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2018-11-23 12:28:10,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:28:11,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:28:11,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:28:11,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:28:11,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:28:11,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {8739#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,118 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100); {8738#false} is VALID [2018-11-23 12:28:11,119 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:28:11,119 INFO L273 TraceCheckUtils]: 40: Hoare triple {8737#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; {8737#true} is VALID [2018-11-23 12:28:11,119 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,119 INFO L273 TraceCheckUtils]: 42: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,120 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,120 INFO L273 TraceCheckUtils]: 46: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 50: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:28:11,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:28:11,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:28:11,122 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:28:11,122 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:28:11,122 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 59: Hoare triple {8737#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; {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 61: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 63: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,123 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 71: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:28:11,124 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:28:11,125 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,125 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99); {8738#false} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:28:11,126 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 88: Hoare triple {8737#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; {8737#true} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 90: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,126 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 92: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 94: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 96: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 98: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,127 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 100: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:28:11,128 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:28:11,128 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:28:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:28:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:11,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:11,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:11,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:11,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:28:11,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:28:11,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:28:11,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:28:11,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:28:11,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:11,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:11,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {8774#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,405 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100); {8738#false} is VALID [2018-11-23 12:28:11,405 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {8738#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; {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,406 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:28:11,408 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {8738#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; {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,409 INFO L273 TraceCheckUtils]: 63: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 65: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 67: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 69: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 71: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,410 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99); {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 88: Hoare triple {8738#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; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,412 INFO L273 TraceCheckUtils]: 90: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 92: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 94: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 96: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 98: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,413 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 100: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:28:11,414 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:28:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:28:11,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:11,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:28:11,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:28:11,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:11,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:28:11,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:11,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:28:11,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:28:11,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:28:11,510 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:28:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:11,996 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:28:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:28:11,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:28:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:28:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:28:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:28:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:28:11,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:28:13,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:13,071 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:28:13,071 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:28:13,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:28:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:28:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:28:13,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:13,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:28:13,162 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:28:13,162 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:28:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:13,164 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:28:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:28:13,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:13,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:13,165 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:28:13,165 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:28:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:13,166 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:28:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:28:13,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:13,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:13,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:13,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:28:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:28:13,169 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:28:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:13,169 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:28:13,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:28:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:28:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:28:13,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:13,171 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:13,171 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:13,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2018-11-23 12:28:13,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:13,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:13,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:28:13,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:28:13,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:28:13,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:28:13,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:28:13,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:28:13,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:28:13,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {9521#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:13,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:13,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {9522#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:13,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:13,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {9523#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:13,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:13,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {9524#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:13,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:13,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {9525#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:13,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:13,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {9526#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:13,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:13,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:13,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:13,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {9528#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:13,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:13,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {9529#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:13,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:13,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {9530#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:13,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:13,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {9531#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:13,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:13,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {9532#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:13,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:13,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {9533#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:13,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:13,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {9534#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:13,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:13,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {9535#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:13,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:13,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {9536#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:13,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:13,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {9537#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9538#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:13,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 100); {9520#false} is VALID [2018-11-23 12:28:13,512 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#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; {9519#true} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,512 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:28:13,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:28:13,515 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:28:13,515 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#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; {9519#true} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:28:13,517 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:13,517 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99); {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:28:13,518 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 90: Hoare triple {9519#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; {9519#true} is VALID [2018-11-23 12:28:13,518 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 92: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 94: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 96: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 98: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,519 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 100: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 102: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:28:13,520 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:28:13,520 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:28:13,521 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:28:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:28:13,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:13,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:14,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:28:14,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:14,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:14,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:28:14,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:28:14,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:28:14,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:28:14,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:28:14,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:28:14,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 33: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,445 INFO L273 TraceCheckUtils]: 35: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L273 TraceCheckUtils]: 37: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L273 TraceCheckUtils]: 39: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 100); {9519#true} is VALID [2018-11-23 12:28:14,446 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:28:14,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#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; {9668#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:14,471 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9668#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:14,472 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:14,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9675#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:14,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9682#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:14,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9682#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:14,474 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9689#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:14,475 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9689#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:14,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9696#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:14,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9696#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:14,476 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9703#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:14,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9703#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:14,477 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9710#(<= xor_~i~0 7)} is VALID [2018-11-23 12:28:14,477 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= xor_~i~0 7)} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:28:14,477 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:28:14,478 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:28:14,478 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:28:14,478 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:28:14,478 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:28:14,478 INFO L273 TraceCheckUtils]: 61: Hoare triple {9520#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; {9520#false} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 63: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 65: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,479 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 67: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 69: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 73: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,480 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:14,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99); {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 90: Hoare triple {9520#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; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,482 INFO L273 TraceCheckUtils]: 92: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 94: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 96: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 100: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:28:14,484 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:28:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-11-23 12:28:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:28:14,511 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:28:14,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:14,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:28:14,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:14,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:28:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:28:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:28:14,600 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:28:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:15,947 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:28:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:28:15,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:28:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:28:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:28:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:28:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:28:15,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:28:16,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:16,081 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:28:16,081 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:28:16,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:28:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:28:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:28:16,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:16,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:28:16,123 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:28:16,123 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:28:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,125 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:28:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:28:16,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,126 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:28:16,126 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:28:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,128 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:28:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:28:16,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:16,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:28:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:28:16,131 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:28:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:28:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:28:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:28:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:28:16,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:16,132 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:16,133 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:16,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2018-11-23 12:28:16,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:16,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:28:16,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:28:16,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:16,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:28:16,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:28:16,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:28:16,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:28:16,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {10339#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:16,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:16,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:16,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:16,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {10341#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:16,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:16,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {10342#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:16,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:16,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {10343#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:16,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:16,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {10344#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:16,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:16,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {10345#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:16,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:16,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {10346#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:16,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:16,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {10347#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:16,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:16,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {10348#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:16,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:16,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {10349#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:16,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:16,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {10350#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:16,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:16,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {10351#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:16,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:16,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {10352#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:16,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:16,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {10353#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:16,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:16,960 INFO L273 TraceCheckUtils]: 37: Hoare triple {10354#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:16,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:16,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {10355#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:16,962 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:16,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {10356#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10357#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:16,963 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 100); {10338#false} is VALID [2018-11-23 12:28:16,963 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:28:16,963 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:28:16,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,964 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,964 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,964 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,964 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,965 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,965 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:28:16,966 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:16,967 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:28:16,967 INFO L273 TraceCheckUtils]: 63: Hoare triple {10338#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:28:16,967 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:28:16,967 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:28:16,967 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,967 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,968 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:16,969 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:28:16,969 INFO L273 TraceCheckUtils]: 84: Hoare triple {10338#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 86: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 88: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 90: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 92: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:28:16,970 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 99); {10338#false} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:28:16,971 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 96: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 98: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,971 INFO L273 TraceCheckUtils]: 102: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 104: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 106: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 108: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:16,972 INFO L273 TraceCheckUtils]: 110: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:16,973 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:28:16,973 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:28:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-23 12:28:16,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:16,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:17,277 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:28:17,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:17,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:28:17,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:28:17,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:17,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:28:17,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:28:17,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:28:17,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:28:17,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10481#(< main_~i~1 100)} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 41: Hoare triple {10481#(< main_~i~1 100)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10485#(<= main_~i~1 100)} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {10485#(<= main_~i~1 100)} assume !(~i~1 < 100); {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {10337#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:28:17,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,517 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:28:17,518 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:28:17,519 INFO L273 TraceCheckUtils]: 84: Hoare triple {10337#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10615#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:17,519 INFO L273 TraceCheckUtils]: 85: Hoare triple {10615#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10615#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:17,520 INFO L273 TraceCheckUtils]: 86: Hoare triple {10615#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10622#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:17,520 INFO L273 TraceCheckUtils]: 87: Hoare triple {10622#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10622#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:17,521 INFO L273 TraceCheckUtils]: 88: Hoare triple {10622#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10629#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:17,521 INFO L273 TraceCheckUtils]: 89: Hoare triple {10629#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10629#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:17,521 INFO L273 TraceCheckUtils]: 90: Hoare triple {10629#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10636#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:17,522 INFO L273 TraceCheckUtils]: 91: Hoare triple {10636#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10636#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:17,522 INFO L273 TraceCheckUtils]: 92: Hoare triple {10636#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10643#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:17,523 INFO L273 TraceCheckUtils]: 93: Hoare triple {10643#(<= main_~i~2 4)} assume !(~i~2 < 99); {10338#false} is VALID [2018-11-23 12:28:17,523 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:28:17,523 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:28:17,523 INFO L273 TraceCheckUtils]: 96: Hoare triple {10338#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; {10338#false} is VALID [2018-11-23 12:28:17,523 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,524 INFO L273 TraceCheckUtils]: 98: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,524 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,524 INFO L273 TraceCheckUtils]: 100: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,524 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,524 INFO L273 TraceCheckUtils]: 102: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 104: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 106: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,525 INFO L273 TraceCheckUtils]: 108: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 110: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 100); {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:28:17,526 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:28:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 269 proven. 16 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:28:17,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:17,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-11-23 12:28:17,552 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-11-23 12:28:17,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:17,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:28:17,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:17,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:28:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:28:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:28:17,695 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2018-11-23 12:28:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:18,766 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-11-23 12:28:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:28:18,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-11-23 12:28:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:28:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 103 transitions. [2018-11-23 12:28:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:28:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 103 transitions. [2018-11-23 12:28:18,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 103 transitions. [2018-11-23 12:28:19,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:19,118 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:28:19,119 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:28:19,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:28:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:28:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:28:19,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:19,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:28:19,244 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:28:19,244 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:28:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,247 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:28:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:28:19,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,248 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:28:19,248 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:28:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,250 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:28:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:28:19,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:19,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:28:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:28:19,252 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 118 [2018-11-23 12:28:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:19,252 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:28:19,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:28:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:28:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:28:19,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:19,253 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 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:28:19,254 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:19,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 19 times [2018-11-23 12:28:19,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:19,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {11220#true} call ULTIMATE.init(); {11220#true} is VALID [2018-11-23 12:28:19,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {11220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11220#true} is VALID [2018-11-23 12:28:19,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:28:19,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11220#true} {11220#true} #66#return; {11220#true} is VALID [2018-11-23 12:28:19,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {11220#true} call #t~ret13 := main(); {11220#true} is VALID [2018-11-23 12:28:19,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {11220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11222#(= main_~i~1 0)} is VALID [2018-11-23 12:28:19,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {11222#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11222#(= main_~i~1 0)} is VALID [2018-11-23 12:28:19,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {11222#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11223#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:19,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {11223#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11223#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:19,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {11223#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11224#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:19,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {11224#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11224#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:19,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {11224#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11225#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:19,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {11225#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11225#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:19,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {11225#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11226#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:19,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {11226#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11226#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:19,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {11226#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11227#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:19,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {11227#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11227#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:19,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {11227#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11228#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:19,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {11228#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11228#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:19,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {11228#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11229#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:19,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {11229#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11229#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:19,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {11229#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11230#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:19,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {11230#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11230#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:19,855 INFO L273 TraceCheckUtils]: 23: Hoare triple {11230#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11231#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:19,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {11231#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11231#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:19,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {11231#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11232#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:19,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {11232#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11232#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:19,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {11232#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11233#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:19,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {11233#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11233#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:19,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {11233#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11234#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:19,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {11234#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11234#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:19,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {11234#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11235#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:19,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {11235#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11235#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:19,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {11235#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11236#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:19,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {11236#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11236#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:19,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {11236#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11237#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:19,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {11237#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11237#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:19,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {11237#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11238#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:19,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {11238#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11238#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:19,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {11238#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11239#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:19,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {11239#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11239#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:19,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {11239#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11240#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:19,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {11240#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11240#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:19,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {11240#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11241#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:19,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {11241#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11241#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:19,869 INFO L273 TraceCheckUtils]: 45: Hoare triple {11241#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11242#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:19,870 INFO L273 TraceCheckUtils]: 46: Hoare triple {11242#(<= main_~i~1 20)} assume !(~i~1 < 100); {11221#false} is VALID [2018-11-23 12:28:19,870 INFO L256 TraceCheckUtils]: 47: Hoare triple {11221#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11220#true} is VALID [2018-11-23 12:28:19,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {11220#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; {11220#true} is VALID [2018-11-23 12:28:19,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,870 INFO L273 TraceCheckUtils]: 50: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,871 INFO L273 TraceCheckUtils]: 51: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,871 INFO L273 TraceCheckUtils]: 53: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,871 INFO L273 TraceCheckUtils]: 54: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,872 INFO L273 TraceCheckUtils]: 60: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 62: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {11220#true} assume !(~i~0 < 100); {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {11220#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:28:19,873 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11220#true} {11221#false} #70#return; {11221#false} is VALID [2018-11-23 12:28:19,873 INFO L273 TraceCheckUtils]: 67: Hoare triple {11221#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:28:19,873 INFO L256 TraceCheckUtils]: 68: Hoare triple {11221#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 69: Hoare triple {11220#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; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 70: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 71: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 72: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 73: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 74: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 75: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 76: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,874 INFO L273 TraceCheckUtils]: 77: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 78: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 79: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 80: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 81: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 82: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 83: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 84: Hoare triple {11220#true} assume !(~i~0 < 100); {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 85: Hoare triple {11220#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11220#true} is VALID [2018-11-23 12:28:19,875 INFO L273 TraceCheckUtils]: 86: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:28:19,876 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {11220#true} {11221#false} #72#return; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 88: Hoare triple {11221#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 89: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 90: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 91: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 92: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 93: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:19,876 INFO L273 TraceCheckUtils]: 94: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 95: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 96: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 97: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 98: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 99: Hoare triple {11221#false} assume !(~i~2 < 99); {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 100: Hoare triple {11221#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:28:19,877 INFO L256 TraceCheckUtils]: 101: Hoare triple {11221#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11220#true} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 102: Hoare triple {11220#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; {11220#true} is VALID [2018-11-23 12:28:19,877 INFO L273 TraceCheckUtils]: 103: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 104: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 105: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 106: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 107: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 108: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 109: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 110: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 111: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,878 INFO L273 TraceCheckUtils]: 112: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 113: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 114: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 115: Hoare triple {11220#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 116: Hoare triple {11220#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 117: Hoare triple {11220#true} assume !(~i~0 < 100); {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 118: Hoare triple {11220#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 119: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:28:19,879 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {11220#true} {11221#false} #74#return; {11221#false} is VALID [2018-11-23 12:28:19,879 INFO L273 TraceCheckUtils]: 121: Hoare triple {11221#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11221#false} is VALID [2018-11-23 12:28:19,880 INFO L273 TraceCheckUtils]: 122: Hoare triple {11221#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11221#false} is VALID [2018-11-23 12:28:19,880 INFO L273 TraceCheckUtils]: 123: Hoare triple {11221#false} assume !false; {11221#false} is VALID [2018-11-23 12:28:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:28:19,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:19,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:19,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:19,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:20,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {11220#true} call ULTIMATE.init(); {11220#true} is VALID [2018-11-23 12:28:20,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {11220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11220#true} is VALID [2018-11-23 12:28:20,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:28:20,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11220#true} {11220#true} #66#return; {11220#true} is VALID [2018-11-23 12:28:20,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {11220#true} call #t~ret13 := main(); {11220#true} is VALID [2018-11-23 12:28:20,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {11220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11261#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:20,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {11261#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11261#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:20,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {11261#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11223#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:20,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {11223#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11223#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:20,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {11223#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11224#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:20,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {11224#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11224#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:20,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {11224#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11225#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:20,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {11225#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11225#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:20,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {11225#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11226#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:20,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {11226#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11226#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:20,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {11226#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11227#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:20,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {11227#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11227#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:20,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {11227#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11228#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:20,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {11228#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11228#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:20,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {11228#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11229#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:20,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {11229#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11229#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:20,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {11229#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11230#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:20,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {11230#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11230#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:20,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {11230#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11231#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:20,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {11231#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11231#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:20,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {11231#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11232#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:20,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {11232#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11232#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:20,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {11232#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11233#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:20,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {11233#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11233#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:20,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {11233#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11234#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:20,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {11234#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11234#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:20,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {11234#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11235#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:20,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {11235#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11235#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:20,351 INFO L273 TraceCheckUtils]: 33: Hoare triple {11235#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11236#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:20,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {11236#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11236#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:20,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {11236#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11237#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:20,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {11237#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11237#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:20,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {11237#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11238#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:20,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {11238#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11238#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:20,355 INFO L273 TraceCheckUtils]: 39: Hoare triple {11238#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11239#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:20,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {11239#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11239#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:20,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {11239#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11240#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:20,357 INFO L273 TraceCheckUtils]: 42: Hoare triple {11240#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11240#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:20,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {11240#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11241#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:20,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {11241#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11241#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:20,359 INFO L273 TraceCheckUtils]: 45: Hoare triple {11241#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11242#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:20,359 INFO L273 TraceCheckUtils]: 46: Hoare triple {11242#(<= main_~i~1 20)} assume !(~i~1 < 100); {11221#false} is VALID [2018-11-23 12:28:20,360 INFO L256 TraceCheckUtils]: 47: Hoare triple {11221#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11221#false} is VALID [2018-11-23 12:28:20,360 INFO L273 TraceCheckUtils]: 48: Hoare triple {11221#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; {11221#false} is VALID [2018-11-23 12:28:20,360 INFO L273 TraceCheckUtils]: 49: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,360 INFO L273 TraceCheckUtils]: 50: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,361 INFO L273 TraceCheckUtils]: 51: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,361 INFO L273 TraceCheckUtils]: 52: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,361 INFO L273 TraceCheckUtils]: 53: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,361 INFO L273 TraceCheckUtils]: 54: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,361 INFO L273 TraceCheckUtils]: 55: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 56: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 57: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 58: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 59: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 60: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {11221#false} assume !(~i~0 < 100); {11221#false} is VALID [2018-11-23 12:28:20,363 INFO L273 TraceCheckUtils]: 64: Hoare triple {11221#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11221#false} is VALID [2018-11-23 12:28:20,363 INFO L273 TraceCheckUtils]: 65: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:28:20,363 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11221#false} {11221#false} #70#return; {11221#false} is VALID [2018-11-23 12:28:20,364 INFO L273 TraceCheckUtils]: 67: Hoare triple {11221#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:28:20,364 INFO L256 TraceCheckUtils]: 68: Hoare triple {11221#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11221#false} is VALID [2018-11-23 12:28:20,364 INFO L273 TraceCheckUtils]: 69: Hoare triple {11221#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; {11221#false} is VALID [2018-11-23 12:28:20,364 INFO L273 TraceCheckUtils]: 70: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,364 INFO L273 TraceCheckUtils]: 71: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 72: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 73: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 74: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 75: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 76: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 77: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 78: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,365 INFO L273 TraceCheckUtils]: 79: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 80: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 81: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 82: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 83: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 84: Hoare triple {11221#false} assume !(~i~0 < 100); {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {11221#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 86: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {11221#false} {11221#false} #72#return; {11221#false} is VALID [2018-11-23 12:28:20,366 INFO L273 TraceCheckUtils]: 88: Hoare triple {11221#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 89: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 90: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 91: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 92: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 93: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 94: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 95: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 96: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:20,367 INFO L273 TraceCheckUtils]: 97: Hoare triple {11221#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 98: Hoare triple {11221#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 99: Hoare triple {11221#false} assume !(~i~2 < 99); {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 100: Hoare triple {11221#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L256 TraceCheckUtils]: 101: Hoare triple {11221#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 102: Hoare triple {11221#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; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 103: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 104: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 105: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,368 INFO L273 TraceCheckUtils]: 106: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 107: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 108: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 109: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 110: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 111: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 112: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 113: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 114: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,369 INFO L273 TraceCheckUtils]: 115: Hoare triple {11221#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 116: Hoare triple {11221#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 117: Hoare triple {11221#false} assume !(~i~0 < 100); {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 118: Hoare triple {11221#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {11221#false} {11221#false} #74#return; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 121: Hoare triple {11221#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 122: Hoare triple {11221#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11221#false} is VALID [2018-11-23 12:28:20,370 INFO L273 TraceCheckUtils]: 123: Hoare triple {11221#false} assume !false; {11221#false} is VALID [2018-11-23 12:28:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:28:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:20,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:28:20,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:28:20,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:20,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:28:20,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:20,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:28:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:28:20,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:28:20,478 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:28:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:20,978 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:28:20,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:28:20,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:28:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:28:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:28:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:28:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:28:20,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:28:21,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:21,074 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:28:21,075 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:28:21,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:28:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:28:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:28:21,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:21,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:28:21,120 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:28:21,120 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:28:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,122 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:28:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:28:21,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,122 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:28:21,123 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:28:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,124 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:28:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:28:21,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:21,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:28:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:28:21,127 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:28:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:21,128 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:28:21,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:28:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:28:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:28:21,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:21,129 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 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:28:21,130 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:21,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:21,130 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 20 times [2018-11-23 12:28:21,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:21,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:21,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {12120#true} call ULTIMATE.init(); {12120#true} is VALID [2018-11-23 12:28:21,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {12120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12120#true} is VALID [2018-11-23 12:28:21,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:28:21,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12120#true} {12120#true} #66#return; {12120#true} is VALID [2018-11-23 12:28:21,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {12120#true} call #t~ret13 := main(); {12120#true} is VALID [2018-11-23 12:28:21,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {12120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12122#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {12122#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12122#(= main_~i~1 0)} is VALID [2018-11-23 12:28:21,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {12122#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:21,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {12123#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {12124#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:21,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {12124#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {12125#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:21,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {12125#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:21,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {12126#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:21,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {12127#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:21,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {12128#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {12129#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:21,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {12129#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {12130#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:21,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {12130#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {12131#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:21,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {12131#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12132#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {12132#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12132#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:21,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {12132#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {12133#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:21,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {12133#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12134#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {12134#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12134#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:21,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {12134#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12135#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {12135#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12135#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:21,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {12135#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12136#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {12136#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12136#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:21,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {12136#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12137#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {12137#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12137#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:21,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {12137#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12138#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {12138#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12138#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:21,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {12138#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12139#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {12139#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12139#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:21,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {12139#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12140#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {12140#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12140#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:21,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {12140#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12141#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {12141#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12141#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:21,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {12141#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12142#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {12142#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12142#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:21,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {12142#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12143#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:21,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {12143#(<= main_~i~1 21)} assume !(~i~1 < 100); {12121#false} is VALID [2018-11-23 12:28:21,942 INFO L256 TraceCheckUtils]: 49: Hoare triple {12121#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12120#true} is VALID [2018-11-23 12:28:21,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {12120#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; {12120#true} is VALID [2018-11-23 12:28:21,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,943 INFO L273 TraceCheckUtils]: 52: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,944 INFO L273 TraceCheckUtils]: 56: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,944 INFO L273 TraceCheckUtils]: 57: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,945 INFO L273 TraceCheckUtils]: 58: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,945 INFO L273 TraceCheckUtils]: 59: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,945 INFO L273 TraceCheckUtils]: 61: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 62: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 63: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 64: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 65: Hoare triple {12120#true} assume !(~i~0 < 100); {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 66: Hoare triple {12120#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12120#true} is VALID [2018-11-23 12:28:21,946 INFO L273 TraceCheckUtils]: 67: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:28:21,947 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12120#true} {12121#false} #70#return; {12121#false} is VALID [2018-11-23 12:28:21,947 INFO L273 TraceCheckUtils]: 69: Hoare triple {12121#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:28:21,947 INFO L256 TraceCheckUtils]: 70: Hoare triple {12121#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12120#true} is VALID [2018-11-23 12:28:21,947 INFO L273 TraceCheckUtils]: 71: Hoare triple {12120#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; {12120#true} is VALID [2018-11-23 12:28:21,947 INFO L273 TraceCheckUtils]: 72: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,947 INFO L273 TraceCheckUtils]: 73: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,947 INFO L273 TraceCheckUtils]: 74: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,948 INFO L273 TraceCheckUtils]: 75: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,948 INFO L273 TraceCheckUtils]: 76: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,948 INFO L273 TraceCheckUtils]: 77: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,948 INFO L273 TraceCheckUtils]: 78: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,949 INFO L273 TraceCheckUtils]: 79: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,949 INFO L273 TraceCheckUtils]: 80: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,949 INFO L273 TraceCheckUtils]: 81: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,949 INFO L273 TraceCheckUtils]: 82: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,949 INFO L273 TraceCheckUtils]: 83: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,950 INFO L273 TraceCheckUtils]: 84: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,950 INFO L273 TraceCheckUtils]: 85: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,950 INFO L273 TraceCheckUtils]: 86: Hoare triple {12120#true} assume !(~i~0 < 100); {12120#true} is VALID [2018-11-23 12:28:21,950 INFO L273 TraceCheckUtils]: 87: Hoare triple {12120#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12120#true} is VALID [2018-11-23 12:28:21,951 INFO L273 TraceCheckUtils]: 88: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:28:21,951 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12120#true} {12121#false} #72#return; {12121#false} is VALID [2018-11-23 12:28:21,951 INFO L273 TraceCheckUtils]: 90: Hoare triple {12121#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12121#false} is VALID [2018-11-23 12:28:21,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:21,951 INFO L273 TraceCheckUtils]: 92: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:21,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:21,952 INFO L273 TraceCheckUtils]: 94: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:21,952 INFO L273 TraceCheckUtils]: 95: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:21,952 INFO L273 TraceCheckUtils]: 96: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:21,952 INFO L273 TraceCheckUtils]: 97: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:21,953 INFO L273 TraceCheckUtils]: 98: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:21,953 INFO L273 TraceCheckUtils]: 99: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:21,953 INFO L273 TraceCheckUtils]: 100: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:21,953 INFO L273 TraceCheckUtils]: 101: Hoare triple {12121#false} assume !(~i~2 < 99); {12121#false} is VALID [2018-11-23 12:28:21,954 INFO L273 TraceCheckUtils]: 102: Hoare triple {12121#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:28:21,954 INFO L256 TraceCheckUtils]: 103: Hoare triple {12121#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12120#true} is VALID [2018-11-23 12:28:21,954 INFO L273 TraceCheckUtils]: 104: Hoare triple {12120#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; {12120#true} is VALID [2018-11-23 12:28:21,954 INFO L273 TraceCheckUtils]: 105: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,954 INFO L273 TraceCheckUtils]: 106: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,955 INFO L273 TraceCheckUtils]: 107: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,955 INFO L273 TraceCheckUtils]: 108: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,955 INFO L273 TraceCheckUtils]: 109: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,955 INFO L273 TraceCheckUtils]: 110: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,955 INFO L273 TraceCheckUtils]: 111: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,956 INFO L273 TraceCheckUtils]: 112: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,956 INFO L273 TraceCheckUtils]: 113: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,956 INFO L273 TraceCheckUtils]: 114: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,956 INFO L273 TraceCheckUtils]: 115: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,956 INFO L273 TraceCheckUtils]: 116: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,957 INFO L273 TraceCheckUtils]: 117: Hoare triple {12120#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12120#true} is VALID [2018-11-23 12:28:21,957 INFO L273 TraceCheckUtils]: 118: Hoare triple {12120#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12120#true} is VALID [2018-11-23 12:28:21,957 INFO L273 TraceCheckUtils]: 119: Hoare triple {12120#true} assume !(~i~0 < 100); {12120#true} is VALID [2018-11-23 12:28:21,957 INFO L273 TraceCheckUtils]: 120: Hoare triple {12120#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12120#true} is VALID [2018-11-23 12:28:21,957 INFO L273 TraceCheckUtils]: 121: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:28:21,958 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12120#true} {12121#false} #74#return; {12121#false} is VALID [2018-11-23 12:28:21,958 INFO L273 TraceCheckUtils]: 123: Hoare triple {12121#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12121#false} is VALID [2018-11-23 12:28:21,958 INFO L273 TraceCheckUtils]: 124: Hoare triple {12121#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12121#false} is VALID [2018-11-23 12:28:21,958 INFO L273 TraceCheckUtils]: 125: Hoare triple {12121#false} assume !false; {12121#false} is VALID [2018-11-23 12:28:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:28:21,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:21,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:22,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:22,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:22,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:22,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {12120#true} call ULTIMATE.init(); {12120#true} is VALID [2018-11-23 12:28:22,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {12120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12120#true} is VALID [2018-11-23 12:28:22,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:28:22,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12120#true} {12120#true} #66#return; {12120#true} is VALID [2018-11-23 12:28:22,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {12120#true} call #t~ret13 := main(); {12120#true} is VALID [2018-11-23 12:28:22,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {12120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12162#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:22,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {12162#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12162#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:22,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {12162#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:22,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12123#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:22,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {12123#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:22,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {12124#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12124#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:22,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {12124#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:22,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {12125#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12125#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:22,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {12125#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:22,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12126#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:22,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {12126#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:22,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12127#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:22,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {12127#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:22,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12128#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:22,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {12128#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:22,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {12129#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12129#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:22,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {12129#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:22,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {12130#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12130#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:22,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {12130#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:22,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {12131#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12131#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:22,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {12131#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12132#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:22,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {12132#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12132#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:22,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {12132#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:22,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {12133#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12133#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:22,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {12133#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12134#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:22,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {12134#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12134#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:22,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {12134#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12135#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:22,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {12135#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12135#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:22,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {12135#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12136#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:22,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {12136#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12136#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:22,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {12136#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12137#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:22,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {12137#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12137#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:22,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {12137#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12138#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:22,359 INFO L273 TraceCheckUtils]: 38: Hoare triple {12138#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12138#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:22,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {12138#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12139#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:22,360 INFO L273 TraceCheckUtils]: 40: Hoare triple {12139#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12139#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:22,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {12139#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12140#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:22,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {12140#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12140#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:22,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {12140#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12141#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:22,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {12141#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12141#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:22,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {12141#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12142#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:22,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {12142#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12142#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:22,364 INFO L273 TraceCheckUtils]: 47: Hoare triple {12142#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12143#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:22,365 INFO L273 TraceCheckUtils]: 48: Hoare triple {12143#(<= main_~i~1 21)} assume !(~i~1 < 100); {12121#false} is VALID [2018-11-23 12:28:22,365 INFO L256 TraceCheckUtils]: 49: Hoare triple {12121#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12121#false} is VALID [2018-11-23 12:28:22,366 INFO L273 TraceCheckUtils]: 50: Hoare triple {12121#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; {12121#false} is VALID [2018-11-23 12:28:22,366 INFO L273 TraceCheckUtils]: 51: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,366 INFO L273 TraceCheckUtils]: 54: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 60: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 63: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 64: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {12121#false} assume !(~i~0 < 100); {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 66: Hoare triple {12121#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 67: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12121#false} {12121#false} #70#return; {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {12121#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L256 TraceCheckUtils]: 70: Hoare triple {12121#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 71: Hoare triple {12121#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; {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 72: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 77: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 78: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 79: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 80: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 81: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 82: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,370 INFO L273 TraceCheckUtils]: 83: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 84: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 85: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 86: Hoare triple {12121#false} assume !(~i~0 < 100); {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 87: Hoare triple {12121#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 88: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12121#false} {12121#false} #72#return; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 90: Hoare triple {12121#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12121#false} is VALID [2018-11-23 12:28:22,371 INFO L273 TraceCheckUtils]: 91: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 92: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 93: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 94: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 95: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 96: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 97: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 98: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 99: Hoare triple {12121#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12121#false} is VALID [2018-11-23 12:28:22,372 INFO L273 TraceCheckUtils]: 100: Hoare triple {12121#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 101: Hoare triple {12121#false} assume !(~i~2 < 99); {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 102: Hoare triple {12121#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L256 TraceCheckUtils]: 103: Hoare triple {12121#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 104: Hoare triple {12121#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; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 105: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 106: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 107: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 108: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,373 INFO L273 TraceCheckUtils]: 109: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 110: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 111: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 112: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 113: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 114: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 115: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 116: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 117: Hoare triple {12121#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12121#false} is VALID [2018-11-23 12:28:22,374 INFO L273 TraceCheckUtils]: 118: Hoare triple {12121#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 119: Hoare triple {12121#false} assume !(~i~0 < 100); {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 120: Hoare triple {12121#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 121: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12121#false} {12121#false} #74#return; {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 123: Hoare triple {12121#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 124: Hoare triple {12121#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12121#false} is VALID [2018-11-23 12:28:22,375 INFO L273 TraceCheckUtils]: 125: Hoare triple {12121#false} assume !false; {12121#false} is VALID [2018-11-23 12:28:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:28:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:22,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:28:22,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:28:22,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:22,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:28:22,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:22,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:28:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:28:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:28:22,542 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2018-11-23 12:28:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,226 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-11-23 12:28:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:28:23,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:28:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:28:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-23 12:28:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:28:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-23 12:28:23,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 96 transitions. [2018-11-23 12:28:23,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:23,381 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:28:23,381 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:28:23,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:28:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:28:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 12:28:23,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:23,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 12:28:23,429 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 12:28:23,430 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 12:28:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,432 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:28:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:28:23,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,433 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 12:28:23,433 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 12:28:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,435 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:28:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:28:23,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:23,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:28:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-23 12:28:23,438 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 126 [2018-11-23 12:28:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:23,438 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-23 12:28:23,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:28:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 12:28:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:28:23,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:23,440 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 5, 5, 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:28:23,440 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:23,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash -140564161, now seen corresponding path program 21 times [2018-11-23 12:28:23,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:23,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:23,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:23,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {13037#true} call ULTIMATE.init(); {13037#true} is VALID [2018-11-23 12:28:23,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {13037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13037#true} is VALID [2018-11-23 12:28:23,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:23,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13037#true} {13037#true} #66#return; {13037#true} is VALID [2018-11-23 12:28:23,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {13037#true} call #t~ret13 := main(); {13037#true} is VALID [2018-11-23 12:28:23,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {13037#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13039#(= main_~i~1 0)} is VALID [2018-11-23 12:28:23,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {13039#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13039#(= main_~i~1 0)} is VALID [2018-11-23 12:28:23,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {13039#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13040#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:23,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {13040#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13040#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:23,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {13040#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13041#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:23,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {13041#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13041#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:23,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {13041#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13042#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:23,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {13042#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13042#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:23,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {13042#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13043#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:23,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {13043#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13043#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:23,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {13043#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13044#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:23,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {13044#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13044#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:23,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {13044#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13045#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:23,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {13045#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13045#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:23,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {13045#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13046#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:23,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {13046#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13046#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:23,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {13046#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13047#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:23,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {13047#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13047#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:23,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {13047#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13048#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:23,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13048#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:23,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {13048#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13049#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:23,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13049#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:23,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {13049#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13050#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:23,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {13050#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13050#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:23,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {13050#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13051#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:23,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {13051#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13051#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:23,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {13051#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13052#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:23,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {13052#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13052#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:23,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {13052#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13053#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:23,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {13053#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13053#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:23,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {13053#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13054#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:23,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {13054#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13054#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:23,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {13054#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13055#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:23,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {13055#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13055#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:23,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {13055#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13056#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:23,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {13056#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13056#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:23,981 INFO L273 TraceCheckUtils]: 41: Hoare triple {13056#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13057#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:23,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {13057#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13057#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:24,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {13057#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13058#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,023 INFO L273 TraceCheckUtils]: 44: Hoare triple {13058#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13058#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {13058#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13059#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {13059#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13059#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {13059#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13060#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {13060#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13060#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {13060#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13061#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:24,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {13061#(<= main_~i~1 22)} assume !(~i~1 < 100); {13038#false} is VALID [2018-11-23 12:28:24,096 INFO L256 TraceCheckUtils]: 51: Hoare triple {13038#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13037#true} is VALID [2018-11-23 12:28:24,096 INFO L273 TraceCheckUtils]: 52: Hoare triple {13037#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; {13037#true} is VALID [2018-11-23 12:28:24,096 INFO L273 TraceCheckUtils]: 53: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 54: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 55: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 56: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,097 INFO L273 TraceCheckUtils]: 59: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 61: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 62: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 63: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 64: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,099 INFO L273 TraceCheckUtils]: 66: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,099 INFO L273 TraceCheckUtils]: 67: Hoare triple {13037#true} assume !(~i~0 < 100); {13037#true} is VALID [2018-11-23 12:28:24,099 INFO L273 TraceCheckUtils]: 68: Hoare triple {13037#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13037#true} is VALID [2018-11-23 12:28:24,099 INFO L273 TraceCheckUtils]: 69: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,099 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13037#true} {13038#false} #70#return; {13038#false} is VALID [2018-11-23 12:28:24,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {13038#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13038#false} is VALID [2018-11-23 12:28:24,099 INFO L256 TraceCheckUtils]: 72: Hoare triple {13038#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {13037#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; {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 74: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 75: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 76: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 77: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,100 INFO L273 TraceCheckUtils]: 78: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 79: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 81: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 82: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 83: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,101 INFO L273 TraceCheckUtils]: 84: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 85: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 87: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 88: Hoare triple {13037#true} assume !(~i~0 < 100); {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 89: Hoare triple {13037#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13037#true} is VALID [2018-11-23 12:28:24,102 INFO L273 TraceCheckUtils]: 90: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,103 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13037#true} {13038#false} #72#return; {13038#false} is VALID [2018-11-23 12:28:24,103 INFO L273 TraceCheckUtils]: 92: Hoare triple {13038#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13038#false} is VALID [2018-11-23 12:28:24,103 INFO L273 TraceCheckUtils]: 93: Hoare triple {13038#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13038#false} is VALID [2018-11-23 12:28:24,103 INFO L273 TraceCheckUtils]: 94: Hoare triple {13038#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13038#false} is VALID [2018-11-23 12:28:24,103 INFO L273 TraceCheckUtils]: 95: Hoare triple {13038#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13038#false} is VALID [2018-11-23 12:28:24,103 INFO L273 TraceCheckUtils]: 96: Hoare triple {13038#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13038#false} is VALID [2018-11-23 12:28:24,104 INFO L273 TraceCheckUtils]: 97: Hoare triple {13038#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13038#false} is VALID [2018-11-23 12:28:24,104 INFO L273 TraceCheckUtils]: 98: Hoare triple {13038#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13038#false} is VALID [2018-11-23 12:28:24,104 INFO L273 TraceCheckUtils]: 99: Hoare triple {13038#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13038#false} is VALID [2018-11-23 12:28:24,104 INFO L273 TraceCheckUtils]: 100: Hoare triple {13038#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13038#false} is VALID [2018-11-23 12:28:24,104 INFO L273 TraceCheckUtils]: 101: Hoare triple {13038#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13038#false} is VALID [2018-11-23 12:28:24,105 INFO L273 TraceCheckUtils]: 102: Hoare triple {13038#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13038#false} is VALID [2018-11-23 12:28:24,105 INFO L273 TraceCheckUtils]: 103: Hoare triple {13038#false} assume !(~i~2 < 99); {13038#false} is VALID [2018-11-23 12:28:24,105 INFO L273 TraceCheckUtils]: 104: Hoare triple {13038#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13038#false} is VALID [2018-11-23 12:28:24,105 INFO L256 TraceCheckUtils]: 105: Hoare triple {13038#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13037#true} is VALID [2018-11-23 12:28:24,105 INFO L273 TraceCheckUtils]: 106: Hoare triple {13037#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; {13037#true} is VALID [2018-11-23 12:28:24,105 INFO L273 TraceCheckUtils]: 107: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 108: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 109: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 110: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 111: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 112: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,106 INFO L273 TraceCheckUtils]: 113: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,107 INFO L273 TraceCheckUtils]: 114: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,107 INFO L273 TraceCheckUtils]: 115: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,107 INFO L273 TraceCheckUtils]: 116: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,107 INFO L273 TraceCheckUtils]: 117: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,107 INFO L273 TraceCheckUtils]: 118: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L273 TraceCheckUtils]: 119: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L273 TraceCheckUtils]: 120: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L273 TraceCheckUtils]: 121: Hoare triple {13037#true} assume !(~i~0 < 100); {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L273 TraceCheckUtils]: 122: Hoare triple {13037#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L273 TraceCheckUtils]: 123: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,108 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {13037#true} {13038#false} #74#return; {13038#false} is VALID [2018-11-23 12:28:24,109 INFO L273 TraceCheckUtils]: 125: Hoare triple {13038#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13038#false} is VALID [2018-11-23 12:28:24,109 INFO L273 TraceCheckUtils]: 126: Hoare triple {13038#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13038#false} is VALID [2018-11-23 12:28:24,109 INFO L273 TraceCheckUtils]: 127: Hoare triple {13038#false} assume !false; {13038#false} is VALID [2018-11-23 12:28:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:28:24,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:24,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:24,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:24,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:28:24,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:24,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:24,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {13037#true} call ULTIMATE.init(); {13037#true} is VALID [2018-11-23 12:28:24,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {13037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13037#true} is VALID [2018-11-23 12:28:24,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13037#true} {13037#true} #66#return; {13037#true} is VALID [2018-11-23 12:28:24,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {13037#true} call #t~ret13 := main(); {13037#true} is VALID [2018-11-23 12:28:24,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {13037#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13037#true} is VALID [2018-11-23 12:28:24,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 41: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 42: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,635 INFO L273 TraceCheckUtils]: 43: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 45: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 46: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 47: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {13037#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {13037#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 50: Hoare triple {13037#true} assume !(~i~1 < 100); {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L256 TraceCheckUtils]: 51: Hoare triple {13037#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13037#true} is VALID [2018-11-23 12:28:24,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {13037#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; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 54: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 55: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 56: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 58: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 59: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,637 INFO L273 TraceCheckUtils]: 61: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 63: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 64: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 65: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 67: Hoare triple {13037#true} assume !(~i~0 < 100); {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 68: Hoare triple {13037#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L273 TraceCheckUtils]: 69: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,638 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13037#true} {13037#true} #70#return; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 71: Hoare triple {13037#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L256 TraceCheckUtils]: 72: Hoare triple {13037#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {13037#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; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 74: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 76: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 77: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 79: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,639 INFO L273 TraceCheckUtils]: 80: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 81: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 83: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 84: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 85: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 86: Hoare triple {13037#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 87: Hoare triple {13037#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 88: Hoare triple {13037#true} assume !(~i~0 < 100); {13037#true} is VALID [2018-11-23 12:28:24,640 INFO L273 TraceCheckUtils]: 89: Hoare triple {13037#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13037#true} is VALID [2018-11-23 12:28:24,641 INFO L273 TraceCheckUtils]: 90: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:28:24,641 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13037#true} {13037#true} #72#return; {13037#true} is VALID [2018-11-23 12:28:24,641 INFO L273 TraceCheckUtils]: 92: Hoare triple {13037#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13341#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:24,642 INFO L273 TraceCheckUtils]: 93: Hoare triple {13341#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13341#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:24,642 INFO L273 TraceCheckUtils]: 94: Hoare triple {13341#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13348#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:24,642 INFO L273 TraceCheckUtils]: 95: Hoare triple {13348#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13348#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:24,643 INFO L273 TraceCheckUtils]: 96: Hoare triple {13348#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13355#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:24,643 INFO L273 TraceCheckUtils]: 97: Hoare triple {13355#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13355#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:24,644 INFO L273 TraceCheckUtils]: 98: Hoare triple {13355#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13362#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:24,644 INFO L273 TraceCheckUtils]: 99: Hoare triple {13362#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13362#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:24,645 INFO L273 TraceCheckUtils]: 100: Hoare triple {13362#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13369#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:24,645 INFO L273 TraceCheckUtils]: 101: Hoare triple {13369#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13369#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:24,646 INFO L273 TraceCheckUtils]: 102: Hoare triple {13369#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13376#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:24,647 INFO L273 TraceCheckUtils]: 103: Hoare triple {13376#(<= main_~i~2 5)} assume !(~i~2 < 99); {13038#false} is VALID [2018-11-23 12:28:24,647 INFO L273 TraceCheckUtils]: 104: Hoare triple {13038#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13038#false} is VALID [2018-11-23 12:28:24,647 INFO L256 TraceCheckUtils]: 105: Hoare triple {13038#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13038#false} is VALID [2018-11-23 12:28:24,647 INFO L273 TraceCheckUtils]: 106: Hoare triple {13038#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; {13038#false} is VALID [2018-11-23 12:28:24,647 INFO L273 TraceCheckUtils]: 107: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 108: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 109: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 110: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 111: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 112: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,648 INFO L273 TraceCheckUtils]: 113: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,649 INFO L273 TraceCheckUtils]: 114: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,649 INFO L273 TraceCheckUtils]: 115: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,649 INFO L273 TraceCheckUtils]: 116: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,649 INFO L273 TraceCheckUtils]: 117: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,649 INFO L273 TraceCheckUtils]: 118: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L273 TraceCheckUtils]: 119: Hoare triple {13038#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L273 TraceCheckUtils]: 120: Hoare triple {13038#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L273 TraceCheckUtils]: 121: Hoare triple {13038#false} assume !(~i~0 < 100); {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L273 TraceCheckUtils]: 122: Hoare triple {13038#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L273 TraceCheckUtils]: 123: Hoare triple {13038#false} assume true; {13038#false} is VALID [2018-11-23 12:28:24,650 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {13038#false} {13038#false} #74#return; {13038#false} is VALID [2018-11-23 12:28:24,651 INFO L273 TraceCheckUtils]: 125: Hoare triple {13038#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13038#false} is VALID [2018-11-23 12:28:24,651 INFO L273 TraceCheckUtils]: 126: Hoare triple {13038#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13038#false} is VALID [2018-11-23 12:28:24,651 INFO L273 TraceCheckUtils]: 127: Hoare triple {13038#false} assume !false; {13038#false} is VALID [2018-11-23 12:28:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-11-23 12:28:24,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:24,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2018-11-23 12:28:24,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-11-23 12:28:24,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:24,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:28:24,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:24,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:28:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:28:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:28:24,777 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 31 states. [2018-11-23 12:28:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:25,227 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-11-23 12:28:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:28:25,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-11-23 12:28:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:28:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2018-11-23 12:28:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:28:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2018-11-23 12:28:25,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 111 transitions. [2018-11-23 12:28:25,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:25,999 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:28:25,999 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:28:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:28:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:28:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-23 12:28:26,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:26,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 95 states. [2018-11-23 12:28:26,043 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 95 states. [2018-11-23 12:28:26,043 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 95 states. [2018-11-23 12:28:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:26,045 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:28:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:28:26,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:26,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:26,046 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 97 states. [2018-11-23 12:28:26,046 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 97 states. [2018-11-23 12:28:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:26,049 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:28:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:28:26,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:26,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:26,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:26,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:28:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:28:26,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 128 [2018-11-23 12:28:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:26,052 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:28:26,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:28:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:28:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:28:26,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:26,053 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 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:28:26,053 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:26,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 22 times [2018-11-23 12:28:26,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:26,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:27,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {13989#true} call ULTIMATE.init(); {13989#true} is VALID [2018-11-23 12:28:27,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {13989#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13989#true} is VALID [2018-11-23 12:28:27,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:28:27,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13989#true} {13989#true} #66#return; {13989#true} is VALID [2018-11-23 12:28:27,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {13989#true} call #t~ret13 := main(); {13989#true} is VALID [2018-11-23 12:28:27,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {13989#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13991#(= main_~i~1 0)} is VALID [2018-11-23 12:28:27,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {13991#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13991#(= main_~i~1 0)} is VALID [2018-11-23 12:28:27,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {13991#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13992#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {13992#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13992#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {13992#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13993#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {13993#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13993#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {13993#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13994#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {13994#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13994#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {13994#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13995#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {13995#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13995#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {13995#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13996#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13996#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {13996#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13997#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {13997#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13997#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {13997#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13998#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {13998#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13998#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {13998#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13999#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {13999#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13999#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {13999#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14000#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {14000#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14000#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {14000#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14001#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {14001#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14001#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {14001#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14002#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14002#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14003#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14003#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14004#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {14004#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14004#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {14004#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14005#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {14005#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14005#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {14005#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14006#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,364 INFO L273 TraceCheckUtils]: 36: Hoare triple {14006#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14006#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,365 INFO L273 TraceCheckUtils]: 37: Hoare triple {14006#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14007#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {14007#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14007#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {14007#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14008#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {14008#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14008#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {14008#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14009#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {14009#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14009#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {14009#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14010#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {14010#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14010#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {14010#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14011#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,371 INFO L273 TraceCheckUtils]: 46: Hoare triple {14011#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14011#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {14011#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14012#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {14012#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14012#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {14012#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14013#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {14013#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14013#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {14013#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14014#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:27,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {14014#(<= main_~i~1 23)} assume !(~i~1 < 100); {13990#false} is VALID [2018-11-23 12:28:27,375 INFO L256 TraceCheckUtils]: 53: Hoare triple {13990#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13989#true} is VALID [2018-11-23 12:28:27,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {13989#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; {13989#true} is VALID [2018-11-23 12:28:27,375 INFO L273 TraceCheckUtils]: 55: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 60: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,376 INFO L273 TraceCheckUtils]: 62: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,378 INFO L273 TraceCheckUtils]: 69: Hoare triple {13989#true} assume !(~i~0 < 100); {13989#true} is VALID [2018-11-23 12:28:27,378 INFO L273 TraceCheckUtils]: 70: Hoare triple {13989#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13989#true} is VALID [2018-11-23 12:28:27,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:28:27,378 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13989#true} {13990#false} #70#return; {13990#false} is VALID [2018-11-23 12:28:27,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {13990#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:28:27,378 INFO L256 TraceCheckUtils]: 74: Hoare triple {13990#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 75: Hoare triple {13989#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; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 78: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 80: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 81: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 82: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,379 INFO L273 TraceCheckUtils]: 84: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 85: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 86: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 87: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 88: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 89: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 90: Hoare triple {13989#true} assume !(~i~0 < 100); {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 91: Hoare triple {13989#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13989#true} is VALID [2018-11-23 12:28:27,380 INFO L273 TraceCheckUtils]: 92: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:28:27,381 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {13989#true} {13990#false} #72#return; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 94: Hoare triple {13990#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 96: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 97: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 98: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 99: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 100: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 101: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,381 INFO L273 TraceCheckUtils]: 102: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 103: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 104: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 105: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 106: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 107: Hoare triple {13990#false} assume !(~i~2 < 99); {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 108: Hoare triple {13990#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:28:27,382 INFO L256 TraceCheckUtils]: 109: Hoare triple {13990#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13989#true} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 110: Hoare triple {13989#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; {13989#true} is VALID [2018-11-23 12:28:27,382 INFO L273 TraceCheckUtils]: 111: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 112: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 113: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 114: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 115: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 116: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 117: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 118: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 119: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,383 INFO L273 TraceCheckUtils]: 120: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 121: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 122: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 123: Hoare triple {13989#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 124: Hoare triple {13989#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 125: Hoare triple {13989#true} assume !(~i~0 < 100); {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 126: Hoare triple {13989#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 127: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:28:27,384 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {13989#true} {13990#false} #74#return; {13990#false} is VALID [2018-11-23 12:28:27,384 INFO L273 TraceCheckUtils]: 129: Hoare triple {13990#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13990#false} is VALID [2018-11-23 12:28:27,385 INFO L273 TraceCheckUtils]: 130: Hoare triple {13990#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13990#false} is VALID [2018-11-23 12:28:27,385 INFO L273 TraceCheckUtils]: 131: Hoare triple {13990#false} assume !false; {13990#false} is VALID [2018-11-23 12:28:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:28:27,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:27,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:27,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:27,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:27,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:27,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {13989#true} call ULTIMATE.init(); {13989#true} is VALID [2018-11-23 12:28:27,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {13989#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13989#true} is VALID [2018-11-23 12:28:27,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:28:27,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13989#true} {13989#true} #66#return; {13989#true} is VALID [2018-11-23 12:28:27,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {13989#true} call #t~ret13 := main(); {13989#true} is VALID [2018-11-23 12:28:27,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {13989#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14033#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:27,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {14033#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14033#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:27,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {14033#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13992#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {13992#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13992#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {13992#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13993#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {13993#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13993#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {13993#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13994#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {13994#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13994#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {13994#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13995#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {13995#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13995#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {13995#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13996#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13996#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {13996#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13997#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {13997#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13997#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {13997#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13998#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {13998#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13998#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {13998#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13999#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {13999#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13999#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {13999#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14000#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {14000#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14000#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {14000#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14001#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {14001#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14001#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {14001#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14002#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14002#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14003#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14003#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14004#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {14004#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14004#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {14004#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14005#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {14005#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14005#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {14005#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14006#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {14006#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14006#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {14006#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14007#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {14007#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14007#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {14007#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14008#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {14008#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14008#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {14008#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14009#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,868 INFO L273 TraceCheckUtils]: 42: Hoare triple {14009#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14009#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,869 INFO L273 TraceCheckUtils]: 43: Hoare triple {14009#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14010#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {14010#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14010#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {14010#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14011#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {14011#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14011#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {14011#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14012#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,872 INFO L273 TraceCheckUtils]: 48: Hoare triple {14012#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14012#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,873 INFO L273 TraceCheckUtils]: 49: Hoare triple {14012#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14013#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 50: Hoare triple {14013#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14013#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {14013#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14014#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {14014#(<= main_~i~1 23)} assume !(~i~1 < 100); {13990#false} is VALID [2018-11-23 12:28:27,875 INFO L256 TraceCheckUtils]: 53: Hoare triple {13990#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13990#false} is VALID [2018-11-23 12:28:27,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {13990#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; {13990#false} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 57: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 60: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 61: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 62: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 66: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 68: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 69: Hoare triple {13990#false} assume !(~i~0 < 100); {13990#false} is VALID [2018-11-23 12:28:27,878 INFO L273 TraceCheckUtils]: 70: Hoare triple {13990#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13990#false} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 71: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:28:27,879 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13990#false} {13990#false} #70#return; {13990#false} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {13990#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:28:27,879 INFO L256 TraceCheckUtils]: 74: Hoare triple {13990#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13990#false} is VALID [2018-11-23 12:28:27,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {13990#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; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 81: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 82: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,880 INFO L273 TraceCheckUtils]: 83: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 85: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {13990#false} assume !(~i~0 < 100); {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {13990#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13990#false} is VALID [2018-11-23 12:28:27,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {13990#false} {13990#false} #72#return; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {13990#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 95: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 96: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 100: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 102: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 103: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 104: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 105: Hoare triple {13990#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 106: Hoare triple {13990#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {13990#false} assume !(~i~2 < 99); {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 108: Hoare triple {13990#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L256 TraceCheckUtils]: 109: Hoare triple {13990#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13990#false} is VALID [2018-11-23 12:28:27,883 INFO L273 TraceCheckUtils]: 110: Hoare triple {13990#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; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 111: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 112: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 113: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 114: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 115: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 116: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 117: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 118: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,884 INFO L273 TraceCheckUtils]: 119: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 120: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 121: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 122: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 123: Hoare triple {13990#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 124: Hoare triple {13990#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 125: Hoare triple {13990#false} assume !(~i~0 < 100); {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 126: Hoare triple {13990#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L273 TraceCheckUtils]: 127: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:28:27,885 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {13990#false} {13990#false} #74#return; {13990#false} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 129: Hoare triple {13990#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13990#false} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 130: Hoare triple {13990#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13990#false} is VALID [2018-11-23 12:28:27,886 INFO L273 TraceCheckUtils]: 131: Hoare triple {13990#false} assume !false; {13990#false} is VALID [2018-11-23 12:28:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:28:27,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:27,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:28:27,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2018-11-23 12:28:27,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:27,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:28:28,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:28,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:28:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:28:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:28:28,003 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 27 states. [2018-11-23 12:28:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:29,056 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 12:28:29,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:28:29,056 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2018-11-23 12:28:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:28:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 100 transitions. [2018-11-23 12:28:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:28:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 100 transitions. [2018-11-23 12:28:29,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 100 transitions. [2018-11-23 12:28:29,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:29,159 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:28:29,159 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:28:29,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:28:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:28:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 12:28:29,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:29,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states. [2018-11-23 12:28:29,346 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states. [2018-11-23 12:28:29,346 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 97 states. [2018-11-23 12:28:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:29,348 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-23 12:28:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 12:28:29,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:29,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:29,349 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states. [2018-11-23 12:28:29,349 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 98 states. [2018-11-23 12:28:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:29,350 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-23 12:28:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 12:28:29,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:29,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:29,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:29,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:28:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-11-23 12:28:29,354 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 132 [2018-11-23 12:28:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:29,354 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-11-23 12:28:29,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:28:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:28:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 12:28:29,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:29,355 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 6, 6, 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:28:29,356 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:29,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash -807181567, now seen corresponding path program 23 times [2018-11-23 12:28:29,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:29,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {14959#true} call ULTIMATE.init(); {14959#true} is VALID [2018-11-23 12:28:30,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {14959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14959#true} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:28:30,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14959#true} {14959#true} #66#return; {14959#true} is VALID [2018-11-23 12:28:30,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {14959#true} call #t~ret13 := main(); {14959#true} is VALID [2018-11-23 12:28:30,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {14959#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14961#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {14961#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14961#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {14961#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14962#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {14962#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14962#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {14962#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14963#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {14963#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14963#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {14963#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14964#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {14964#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14964#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {14964#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14965#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {14965#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14965#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {14965#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14966#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {14966#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14966#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {14966#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14967#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {14967#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14967#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {14967#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14968#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {14968#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14968#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {14968#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14969#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {14969#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14969#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {14969#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14970#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {14970#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14970#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {14970#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14971#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {14971#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14971#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {14971#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14972#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {14972#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14972#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {14972#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14973#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {14973#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14973#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {14973#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14974#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,549 INFO L273 TraceCheckUtils]: 32: Hoare triple {14974#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14974#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {14974#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14975#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {14975#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14975#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {14975#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14976#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {14976#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14976#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {14976#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14977#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {14977#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14977#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {14977#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14978#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {14978#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14978#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {14978#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14979#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {14979#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14979#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {14979#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14980#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {14980#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14980#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {14980#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14981#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {14981#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14981#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,559 INFO L273 TraceCheckUtils]: 47: Hoare triple {14981#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14982#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {14982#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14982#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,560 INFO L273 TraceCheckUtils]: 49: Hoare triple {14982#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14983#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,560 INFO L273 TraceCheckUtils]: 50: Hoare triple {14983#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14983#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {14983#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14984#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,562 INFO L273 TraceCheckUtils]: 52: Hoare triple {14984#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14984#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {14984#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14985#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:30,563 INFO L273 TraceCheckUtils]: 54: Hoare triple {14985#(<= main_~i~1 24)} assume !(~i~1 < 100); {14960#false} is VALID [2018-11-23 12:28:30,563 INFO L256 TraceCheckUtils]: 55: Hoare triple {14960#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14959#true} is VALID [2018-11-23 12:28:30,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {14959#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; {14959#true} is VALID [2018-11-23 12:28:30,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,564 INFO L273 TraceCheckUtils]: 60: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,564 INFO L273 TraceCheckUtils]: 61: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,565 INFO L273 TraceCheckUtils]: 65: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,565 INFO L273 TraceCheckUtils]: 66: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 67: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 68: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 69: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {14959#true} assume !(~i~0 < 100); {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 72: Hoare triple {14959#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L273 TraceCheckUtils]: 73: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:28:30,566 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {14959#true} {14960#false} #70#return; {14960#false} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 75: Hoare triple {14960#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:28:30,567 INFO L256 TraceCheckUtils]: 76: Hoare triple {14960#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 77: Hoare triple {14959#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; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 78: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 79: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 80: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 81: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 84: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 85: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 87: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 89: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 90: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 91: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,568 INFO L273 TraceCheckUtils]: 92: Hoare triple {14959#true} assume !(~i~0 < 100); {14959#true} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 93: Hoare triple {14959#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14959#true} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 94: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:28:30,569 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14959#true} {14960#false} #72#return; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 96: Hoare triple {14960#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 97: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 98: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 99: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 100: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 101: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,569 INFO L273 TraceCheckUtils]: 102: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 103: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 104: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 105: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 106: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 107: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 108: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 109: Hoare triple {14960#false} assume !(~i~2 < 99); {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L273 TraceCheckUtils]: 110: Hoare triple {14960#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:28:30,570 INFO L256 TraceCheckUtils]: 111: Hoare triple {14960#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 112: Hoare triple {14959#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; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 113: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 114: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 115: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 116: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 117: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 118: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,571 INFO L273 TraceCheckUtils]: 120: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 121: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 122: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 123: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 124: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 125: Hoare triple {14959#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 126: Hoare triple {14959#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 127: Hoare triple {14959#true} assume !(~i~0 < 100); {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 128: Hoare triple {14959#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14959#true} is VALID [2018-11-23 12:28:30,572 INFO L273 TraceCheckUtils]: 129: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:28:30,573 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {14959#true} {14960#false} #74#return; {14960#false} is VALID [2018-11-23 12:28:30,573 INFO L273 TraceCheckUtils]: 131: Hoare triple {14960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14960#false} is VALID [2018-11-23 12:28:30,573 INFO L273 TraceCheckUtils]: 132: Hoare triple {14960#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14960#false} is VALID [2018-11-23 12:28:30,573 INFO L273 TraceCheckUtils]: 133: Hoare triple {14960#false} assume !false; {14960#false} is VALID [2018-11-23 12:28:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:28:30,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:30,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:30,592 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:31,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:28:31,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:31,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:31,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {14959#true} call ULTIMATE.init(); {14959#true} is VALID [2018-11-23 12:28:31,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {14959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14959#true} is VALID [2018-11-23 12:28:31,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:28:31,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14959#true} {14959#true} #66#return; {14959#true} is VALID [2018-11-23 12:28:31,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {14959#true} call #t~ret13 := main(); {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {14959#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {14959#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14959#true} is VALID [2018-11-23 12:28:31,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {14959#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14959#true} is VALID [2018-11-23 12:28:31,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {14959#true} assume !(~i~1 < 100); {14959#true} is VALID [2018-11-23 12:28:31,966 INFO L256 TraceCheckUtils]: 55: Hoare triple {14959#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14959#true} is VALID [2018-11-23 12:28:31,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {14959#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; {15157#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:31,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {15157#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15157#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:31,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {15157#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15164#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:31,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {15164#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15164#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:31,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {15164#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15171#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:31,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {15171#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15171#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:31,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {15171#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15178#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:31,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {15178#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15178#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:31,970 INFO L273 TraceCheckUtils]: 64: Hoare triple {15178#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15185#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:31,971 INFO L273 TraceCheckUtils]: 65: Hoare triple {15185#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15185#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:31,971 INFO L273 TraceCheckUtils]: 66: Hoare triple {15185#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15192#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:31,972 INFO L273 TraceCheckUtils]: 67: Hoare triple {15192#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15192#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:31,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {15192#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15199#(<= xor_~i~0 7)} is VALID [2018-11-23 12:28:31,973 INFO L273 TraceCheckUtils]: 69: Hoare triple {15199#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15199#(<= xor_~i~0 7)} is VALID [2018-11-23 12:28:31,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {15199#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15206#(<= xor_~i~0 8)} is VALID [2018-11-23 12:28:31,974 INFO L273 TraceCheckUtils]: 71: Hoare triple {15206#(<= xor_~i~0 8)} assume !(~i~0 < 100); {14960#false} is VALID [2018-11-23 12:28:31,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {14960#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14960#false} is VALID [2018-11-23 12:28:31,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:28:31,975 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {14960#false} {14959#true} #70#return; {14960#false} is VALID [2018-11-23 12:28:31,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {14960#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:28:31,975 INFO L256 TraceCheckUtils]: 76: Hoare triple {14960#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14960#false} is VALID [2018-11-23 12:28:31,976 INFO L273 TraceCheckUtils]: 77: Hoare triple {14960#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; {14960#false} is VALID [2018-11-23 12:28:31,976 INFO L273 TraceCheckUtils]: 78: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,976 INFO L273 TraceCheckUtils]: 80: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,976 INFO L273 TraceCheckUtils]: 81: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,977 INFO L273 TraceCheckUtils]: 83: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,977 INFO L273 TraceCheckUtils]: 84: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,977 INFO L273 TraceCheckUtils]: 85: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,977 INFO L273 TraceCheckUtils]: 86: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 87: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 88: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 89: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 91: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,978 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#false} assume !(~i~0 < 100); {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 93: Hoare triple {14960#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 94: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14960#false} {14960#false} #72#return; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 96: Hoare triple {14960#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 97: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 98: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 99: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,979 INFO L273 TraceCheckUtils]: 100: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 101: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 102: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 103: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 104: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 105: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 106: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 107: Hoare triple {14960#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 108: Hoare triple {14960#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14960#false} is VALID [2018-11-23 12:28:31,980 INFO L273 TraceCheckUtils]: 109: Hoare triple {14960#false} assume !(~i~2 < 99); {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 110: Hoare triple {14960#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L256 TraceCheckUtils]: 111: Hoare triple {14960#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 112: Hoare triple {14960#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; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 113: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 114: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 115: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 116: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 117: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,981 INFO L273 TraceCheckUtils]: 118: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 119: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 120: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 121: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 122: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 123: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 124: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 125: Hoare triple {14960#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 126: Hoare triple {14960#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14960#false} is VALID [2018-11-23 12:28:31,982 INFO L273 TraceCheckUtils]: 127: Hoare triple {14960#false} assume !(~i~0 < 100); {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L273 TraceCheckUtils]: 128: Hoare triple {14960#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L273 TraceCheckUtils]: 129: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {14960#false} {14960#false} #74#return; {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L273 TraceCheckUtils]: 131: Hoare triple {14960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L273 TraceCheckUtils]: 132: Hoare triple {14960#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14960#false} is VALID [2018-11-23 12:28:31,983 INFO L273 TraceCheckUtils]: 133: Hoare triple {14960#false} assume !false; {14960#false} is VALID [2018-11-23 12:28:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2018-11-23 12:28:32,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:32,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-23 12:28:32,012 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-11-23 12:28:32,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:32,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:32,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:32,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:32,119 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 35 states. [2018-11-23 12:28:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:32,938 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-11-23 12:28:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:32,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-11-23 12:28:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:28:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:28:32,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2018-11-23 12:28:33,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:33,183 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:28:33,183 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:28:33,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:28:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-23 12:28:33,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:33,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-23 12:28:33,243 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-23 12:28:33,244 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-23 12:28:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,245 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:28:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:33,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,246 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-23 12:28:33,246 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-23 12:28:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,248 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:28:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:33,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:33,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:28:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-23 12:28:33,250 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 134 [2018-11-23 12:28:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:33,250 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-23 12:28:33,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:28:33,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:33,251 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 6, 6, 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:28:33,252 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:33,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1827973695, now seen corresponding path program 24 times [2018-11-23 12:28:33,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:33,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:33,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {15966#true} call ULTIMATE.init(); {15966#true} is VALID [2018-11-23 12:28:34,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {15966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15966#true} is VALID [2018-11-23 12:28:34,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:34,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15966#true} {15966#true} #66#return; {15966#true} is VALID [2018-11-23 12:28:34,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {15966#true} call #t~ret13 := main(); {15966#true} is VALID [2018-11-23 12:28:34,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {15966#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15968#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {15968#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15968#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {15968#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15969#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {15969#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15969#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {15969#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15970#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {15970#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15970#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {15970#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15971#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {15971#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15971#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {15971#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15972#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {15972#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15972#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {15972#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15973#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {15973#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15973#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {15973#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15974#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {15974#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15974#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {15974#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15975#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {15975#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15975#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {15975#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15976#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {15976#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15976#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {15976#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15977#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {15977#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15977#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {15977#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15978#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {15978#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15978#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {15978#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15979#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {15979#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15979#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {15979#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15980#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {15980#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15980#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {15980#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15981#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {15981#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15981#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {15981#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15982#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {15982#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15982#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {15982#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15983#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {15983#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15983#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {15983#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15984#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {15984#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15984#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {15984#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15985#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {15985#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15985#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {15985#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15986#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {15986#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15986#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {15986#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15987#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {15987#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15987#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {15987#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15988#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {15988#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15988#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {15988#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15989#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,816 INFO L273 TraceCheckUtils]: 48: Hoare triple {15989#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15989#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {15989#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15990#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {15990#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15990#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {15990#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15991#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {15991#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15991#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {15991#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15992#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,820 INFO L273 TraceCheckUtils]: 54: Hoare triple {15992#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15992#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,820 INFO L273 TraceCheckUtils]: 55: Hoare triple {15992#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15993#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,821 INFO L273 TraceCheckUtils]: 56: Hoare triple {15993#(<= main_~i~1 25)} assume !(~i~1 < 100); {15967#false} is VALID [2018-11-23 12:28:34,821 INFO L256 TraceCheckUtils]: 57: Hoare triple {15967#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15966#true} is VALID [2018-11-23 12:28:34,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {15966#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; {15966#true} is VALID [2018-11-23 12:28:34,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,822 INFO L273 TraceCheckUtils]: 60: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,822 INFO L273 TraceCheckUtils]: 61: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 63: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 64: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 66: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 67: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,823 INFO L273 TraceCheckUtils]: 68: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,824 INFO L273 TraceCheckUtils]: 69: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,824 INFO L273 TraceCheckUtils]: 70: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,824 INFO L273 TraceCheckUtils]: 71: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,824 INFO L273 TraceCheckUtils]: 72: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,824 INFO L273 TraceCheckUtils]: 73: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,825 INFO L273 TraceCheckUtils]: 74: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,825 INFO L273 TraceCheckUtils]: 75: Hoare triple {15966#true} assume !(~i~0 < 100); {15966#true} is VALID [2018-11-23 12:28:34,825 INFO L273 TraceCheckUtils]: 76: Hoare triple {15966#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15966#true} is VALID [2018-11-23 12:28:34,825 INFO L273 TraceCheckUtils]: 77: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:34,825 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {15966#true} {15967#false} #70#return; {15967#false} is VALID [2018-11-23 12:28:34,825 INFO L273 TraceCheckUtils]: 79: Hoare triple {15967#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15967#false} is VALID [2018-11-23 12:28:34,825 INFO L256 TraceCheckUtils]: 80: Hoare triple {15967#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 81: Hoare triple {15966#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; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 82: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 83: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 84: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 85: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 86: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 87: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 88: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,826 INFO L273 TraceCheckUtils]: 89: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 90: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 91: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 92: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 93: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,827 INFO L273 TraceCheckUtils]: 98: Hoare triple {15966#true} assume !(~i~0 < 100); {15966#true} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 99: Hoare triple {15966#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15966#true} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 100: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:34,828 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {15966#true} {15967#false} #72#return; {15967#false} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 102: Hoare triple {15967#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15967#false} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 103: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 104: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 105: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 106: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 107: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 108: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 109: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 110: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 111: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 112: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 113: Hoare triple {15967#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15967#false} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 114: Hoare triple {15967#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15967#false} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 115: Hoare triple {15967#false} assume !(~i~2 < 99); {15967#false} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {15967#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {15967#false} is VALID [2018-11-23 12:28:34,830 INFO L256 TraceCheckUtils]: 117: Hoare triple {15967#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15966#true} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 118: Hoare triple {15966#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; {15966#true} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 119: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 120: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 121: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 122: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 123: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 124: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 125: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 126: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 127: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 128: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 129: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 130: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 131: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 132: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 133: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 134: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 135: Hoare triple {15966#true} assume !(~i~0 < 100); {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 136: Hoare triple {15966#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 137: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:34,833 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {15966#true} {15967#false} #74#return; {15967#false} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 139: Hoare triple {15967#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15967#false} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 140: Hoare triple {15967#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15967#false} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 141: Hoare triple {15967#false} assume !false; {15967#false} is VALID [2018-11-23 12:28:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:28:34,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:34,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:34,852 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:35,327 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:28:35,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:35,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:36,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {15966#true} call ULTIMATE.init(); {15966#true} is VALID [2018-11-23 12:28:36,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {15966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15966#true} is VALID [2018-11-23 12:28:36,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:36,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15966#true} {15966#true} #66#return; {15966#true} is VALID [2018-11-23 12:28:36,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {15966#true} call #t~ret13 := main(); {15966#true} is VALID [2018-11-23 12:28:36,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {15966#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15966#true} is VALID [2018-11-23 12:28:36,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 50: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {15966#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {15966#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15966#true} is VALID [2018-11-23 12:28:36,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {15966#true} assume !(~i~1 < 100); {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L256 TraceCheckUtils]: 57: Hoare triple {15966#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {15966#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; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 67: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 69: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 73: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {15966#true} assume !(~i~0 < 100); {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {15966#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 77: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {15966#true} {15966#true} #70#return; {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {15966#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L256 TraceCheckUtils]: 80: Hoare triple {15966#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {15966#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; {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,657 INFO L273 TraceCheckUtils]: 93: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 98: Hoare triple {15966#true} assume !(~i~0 < 100); {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {15966#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L273 TraceCheckUtils]: 100: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:28:36,658 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {15966#true} {15966#true} #72#return; {15966#true} is VALID [2018-11-23 12:28:36,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {15966#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16303#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:36,660 INFO L273 TraceCheckUtils]: 103: Hoare triple {16303#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16303#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:36,661 INFO L273 TraceCheckUtils]: 104: Hoare triple {16303#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16310#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:36,661 INFO L273 TraceCheckUtils]: 105: Hoare triple {16310#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16310#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:36,661 INFO L273 TraceCheckUtils]: 106: Hoare triple {16310#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16317#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:36,662 INFO L273 TraceCheckUtils]: 107: Hoare triple {16317#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16317#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:36,663 INFO L273 TraceCheckUtils]: 108: Hoare triple {16317#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16324#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:36,663 INFO L273 TraceCheckUtils]: 109: Hoare triple {16324#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16324#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:36,664 INFO L273 TraceCheckUtils]: 110: Hoare triple {16324#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16331#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:36,664 INFO L273 TraceCheckUtils]: 111: Hoare triple {16331#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16331#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:36,665 INFO L273 TraceCheckUtils]: 112: Hoare triple {16331#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16338#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:36,665 INFO L273 TraceCheckUtils]: 113: Hoare triple {16338#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16338#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:36,666 INFO L273 TraceCheckUtils]: 114: Hoare triple {16338#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16345#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:36,667 INFO L273 TraceCheckUtils]: 115: Hoare triple {16345#(<= main_~i~2 6)} assume !(~i~2 < 99); {15967#false} is VALID [2018-11-23 12:28:36,667 INFO L273 TraceCheckUtils]: 116: Hoare triple {15967#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {15967#false} is VALID [2018-11-23 12:28:36,667 INFO L256 TraceCheckUtils]: 117: Hoare triple {15967#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15967#false} is VALID [2018-11-23 12:28:36,667 INFO L273 TraceCheckUtils]: 118: Hoare triple {15967#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; {15967#false} is VALID [2018-11-23 12:28:36,667 INFO L273 TraceCheckUtils]: 119: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 120: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 121: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 122: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 123: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 124: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,668 INFO L273 TraceCheckUtils]: 125: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,669 INFO L273 TraceCheckUtils]: 126: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,669 INFO L273 TraceCheckUtils]: 127: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,669 INFO L273 TraceCheckUtils]: 128: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,669 INFO L273 TraceCheckUtils]: 129: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,669 INFO L273 TraceCheckUtils]: 130: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 131: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 132: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 133: Hoare triple {15967#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 134: Hoare triple {15967#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 135: Hoare triple {15967#false} assume !(~i~0 < 100); {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 136: Hoare triple {15967#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 137: Hoare triple {15967#false} assume true; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {15967#false} {15967#false} #74#return; {15967#false} is VALID [2018-11-23 12:28:36,670 INFO L273 TraceCheckUtils]: 139: Hoare triple {15967#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15967#false} is VALID [2018-11-23 12:28:36,671 INFO L273 TraceCheckUtils]: 140: Hoare triple {15967#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15967#false} is VALID [2018-11-23 12:28:36,671 INFO L273 TraceCheckUtils]: 141: Hoare triple {15967#false} assume !false; {15967#false} is VALID [2018-11-23 12:28:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2018-11-23 12:28:36,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:36,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2018-11-23 12:28:36,698 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-11-23 12:28:36,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:36,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:37,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:37,313 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 35 states. [2018-11-23 12:28:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,189 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-23 12:28:38,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:38,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-11-23 12:28:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 119 transitions. [2018-11-23 12:28:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 119 transitions. [2018-11-23 12:28:38,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 119 transitions. [2018-11-23 12:28:38,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:38,308 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:28:38,308 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:28:38,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:28:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 12:28:38,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:38,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 12:28:38,375 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 12:28:38,376 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 12:28:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,379 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-23 12:28:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:38,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,380 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 12:28:38,380 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 12:28:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,382 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-23 12:28:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:38,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:38,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:28:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:28:38,385 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 142 [2018-11-23 12:28:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:38,386 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:28:38,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:28:38,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:38,387 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 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:28:38,387 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:38,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 25 times [2018-11-23 12:28:38,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:38,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:38,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:38,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {17020#true} call ULTIMATE.init(); {17020#true} is VALID [2018-11-23 12:28:38,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {17020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17020#true} is VALID [2018-11-23 12:28:38,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:28:38,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17020#true} {17020#true} #66#return; {17020#true} is VALID [2018-11-23 12:28:38,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {17020#true} call #t~ret13 := main(); {17020#true} is VALID [2018-11-23 12:28:38,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {17020#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17022#(= main_~i~1 0)} is VALID [2018-11-23 12:28:38,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {17022#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17022#(= main_~i~1 0)} is VALID [2018-11-23 12:28:38,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {17022#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17023#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {17023#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17023#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {17023#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17024#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {17024#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17024#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {17024#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17025#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {17025#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17025#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {17025#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17026#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {17026#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17026#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {17026#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17027#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {17027#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17027#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {17027#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17028#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {17028#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17028#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {17028#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17029#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {17029#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17029#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {17029#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17030#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {17030#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17030#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {17030#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17031#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,976 INFO L273 TraceCheckUtils]: 24: Hoare triple {17031#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17031#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,977 INFO L273 TraceCheckUtils]: 25: Hoare triple {17031#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17032#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {17032#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17032#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {17032#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17033#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {17033#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17033#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {17033#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17034#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {17034#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17034#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {17034#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17035#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,981 INFO L273 TraceCheckUtils]: 32: Hoare triple {17035#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17035#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {17035#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17036#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {17036#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17036#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {17036#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17037#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {17037#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17037#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {17037#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17038#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {17038#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17038#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {17038#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17039#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {17039#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17039#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {17039#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17040#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {17040#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17040#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {17040#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17041#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {17041#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17041#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {17041#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17042#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {17042#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17042#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,991 INFO L273 TraceCheckUtils]: 47: Hoare triple {17042#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17043#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,991 INFO L273 TraceCheckUtils]: 48: Hoare triple {17043#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17043#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,992 INFO L273 TraceCheckUtils]: 49: Hoare triple {17043#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17044#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,992 INFO L273 TraceCheckUtils]: 50: Hoare triple {17044#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17044#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {17044#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17045#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,993 INFO L273 TraceCheckUtils]: 52: Hoare triple {17045#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17045#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,994 INFO L273 TraceCheckUtils]: 53: Hoare triple {17045#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17046#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {17046#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17046#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {17046#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17047#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,996 INFO L273 TraceCheckUtils]: 56: Hoare triple {17047#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17047#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,997 INFO L273 TraceCheckUtils]: 57: Hoare triple {17047#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17048#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:38,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {17048#(<= main_~i~1 26)} assume !(~i~1 < 100); {17021#false} is VALID [2018-11-23 12:28:38,998 INFO L256 TraceCheckUtils]: 59: Hoare triple {17021#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17020#true} is VALID [2018-11-23 12:28:38,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {17020#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; {17020#true} is VALID [2018-11-23 12:28:38,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:38,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:38,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 64: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:38,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,000 INFO L273 TraceCheckUtils]: 70: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,000 INFO L273 TraceCheckUtils]: 71: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,000 INFO L273 TraceCheckUtils]: 72: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,000 INFO L273 TraceCheckUtils]: 73: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 74: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 77: Hoare triple {17020#true} assume !(~i~0 < 100); {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 78: Hoare triple {17020#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L273 TraceCheckUtils]: 79: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:28:39,001 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17020#true} {17021#false} #70#return; {17021#false} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 81: Hoare triple {17021#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:28:39,002 INFO L256 TraceCheckUtils]: 82: Hoare triple {17021#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 83: Hoare triple {17020#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; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 85: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 86: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 87: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 88: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 89: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,002 INFO L273 TraceCheckUtils]: 90: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 91: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 92: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 93: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 94: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 95: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 96: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 97: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 98: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,003 INFO L273 TraceCheckUtils]: 99: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 100: Hoare triple {17020#true} assume !(~i~0 < 100); {17020#true} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 101: Hoare triple {17020#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17020#true} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 102: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:28:39,004 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17020#true} {17021#false} #72#return; {17021#false} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 104: Hoare triple {17021#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17021#false} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 105: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 106: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 107: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,004 INFO L273 TraceCheckUtils]: 108: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 109: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 110: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 111: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 112: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 113: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 114: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 115: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 116: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 117: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,005 INFO L273 TraceCheckUtils]: 118: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 119: Hoare triple {17021#false} assume !(~i~2 < 99); {17021#false} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 120: Hoare triple {17021#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:28:39,006 INFO L256 TraceCheckUtils]: 121: Hoare triple {17021#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 122: Hoare triple {17020#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; {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 123: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 124: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 125: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 126: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,006 INFO L273 TraceCheckUtils]: 127: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 128: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 129: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 130: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 131: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 132: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 133: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 134: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 135: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,007 INFO L273 TraceCheckUtils]: 136: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 137: Hoare triple {17020#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 138: Hoare triple {17020#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 139: Hoare triple {17020#true} assume !(~i~0 < 100); {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 140: Hoare triple {17020#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 141: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:28:39,008 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17020#true} {17021#false} #74#return; {17021#false} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 143: Hoare triple {17021#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17021#false} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 144: Hoare triple {17021#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17021#false} is VALID [2018-11-23 12:28:39,008 INFO L273 TraceCheckUtils]: 145: Hoare triple {17021#false} assume !false; {17021#false} is VALID [2018-11-23 12:28:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:39,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:39,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:39,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:39,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {17020#true} call ULTIMATE.init(); {17020#true} is VALID [2018-11-23 12:28:39,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {17020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17020#true} is VALID [2018-11-23 12:28:39,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:28:39,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17020#true} {17020#true} #66#return; {17020#true} is VALID [2018-11-23 12:28:39,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {17020#true} call #t~ret13 := main(); {17020#true} is VALID [2018-11-23 12:28:39,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {17020#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17067#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:39,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {17067#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17067#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:39,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {17067#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17023#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {17023#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17023#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {17023#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17024#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {17024#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17024#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {17024#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17025#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {17025#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17025#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {17025#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17026#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {17026#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17026#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {17026#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17027#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {17027#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17027#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {17027#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17028#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {17028#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17028#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {17028#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17029#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {17029#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17029#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {17029#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17030#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {17030#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17030#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {17030#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17031#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {17031#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17031#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {17031#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17032#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {17032#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17032#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {17032#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17033#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {17033#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17033#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {17033#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17034#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:39,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {17034#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17034#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:39,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {17034#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17035#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:39,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {17035#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17035#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:39,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {17035#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17036#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:39,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {17036#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17036#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:39,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {17036#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17037#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:39,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {17037#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17037#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:39,367 INFO L273 TraceCheckUtils]: 37: Hoare triple {17037#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17038#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:39,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {17038#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17038#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:39,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {17038#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17039#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:39,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {17039#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17039#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:39,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {17039#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17040#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:39,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {17040#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17040#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:39,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {17040#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17041#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:39,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {17041#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17041#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:39,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {17041#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17042#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:39,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {17042#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17042#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:39,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {17042#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17043#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:39,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {17043#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17043#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:39,374 INFO L273 TraceCheckUtils]: 49: Hoare triple {17043#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17044#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:39,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {17044#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17044#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:39,375 INFO L273 TraceCheckUtils]: 51: Hoare triple {17044#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17045#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:39,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {17045#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17045#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:39,377 INFO L273 TraceCheckUtils]: 53: Hoare triple {17045#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17046#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:39,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {17046#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17046#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:39,378 INFO L273 TraceCheckUtils]: 55: Hoare triple {17046#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17047#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:39,378 INFO L273 TraceCheckUtils]: 56: Hoare triple {17047#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17047#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:39,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {17047#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17048#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:39,380 INFO L273 TraceCheckUtils]: 58: Hoare triple {17048#(<= main_~i~1 26)} assume !(~i~1 < 100); {17021#false} is VALID [2018-11-23 12:28:39,380 INFO L256 TraceCheckUtils]: 59: Hoare triple {17021#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17021#false} is VALID [2018-11-23 12:28:39,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {17021#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; {17021#false} is VALID [2018-11-23 12:28:39,380 INFO L273 TraceCheckUtils]: 61: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 62: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 64: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 71: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 75: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 77: Hoare triple {17021#false} assume !(~i~0 < 100); {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 78: Hoare triple {17021#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17021#false} {17021#false} #70#return; {17021#false} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {17021#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L256 TraceCheckUtils]: 82: Hoare triple {17021#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {17021#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; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 88: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 89: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 90: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 91: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 92: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 93: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 95: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 96: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 97: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 98: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,385 INFO L273 TraceCheckUtils]: 99: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 100: Hoare triple {17021#false} assume !(~i~0 < 100); {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 101: Hoare triple {17021#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 102: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17021#false} {17021#false} #72#return; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 104: Hoare triple {17021#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 105: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 106: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 107: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,386 INFO L273 TraceCheckUtils]: 108: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 109: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 110: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 111: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 112: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 113: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 114: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,387 INFO L273 TraceCheckUtils]: 115: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 116: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 117: Hoare triple {17021#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 118: Hoare triple {17021#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 119: Hoare triple {17021#false} assume !(~i~2 < 99); {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 120: Hoare triple {17021#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L256 TraceCheckUtils]: 121: Hoare triple {17021#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17021#false} is VALID [2018-11-23 12:28:39,388 INFO L273 TraceCheckUtils]: 122: Hoare triple {17021#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; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 123: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 124: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 125: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 126: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 127: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 128: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,389 INFO L273 TraceCheckUtils]: 129: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 130: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 131: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 132: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 133: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 134: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 135: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,390 INFO L273 TraceCheckUtils]: 136: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 137: Hoare triple {17021#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 138: Hoare triple {17021#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 139: Hoare triple {17021#false} assume !(~i~0 < 100); {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 140: Hoare triple {17021#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 141: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17021#false} {17021#false} #74#return; {17021#false} is VALID [2018-11-23 12:28:39,391 INFO L273 TraceCheckUtils]: 143: Hoare triple {17021#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17021#false} is VALID [2018-11-23 12:28:39,392 INFO L273 TraceCheckUtils]: 144: Hoare triple {17021#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17021#false} is VALID [2018-11-23 12:28:39,392 INFO L273 TraceCheckUtils]: 145: Hoare triple {17021#false} assume !false; {17021#false} is VALID [2018-11-23 12:28:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:39,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:39,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:28:39,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:39,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:39,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:39,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:39,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:39,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:39,574 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:28:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,528 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:28:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:28:40,529 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:40,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:28:40,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:40,634 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:28:40,634 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:28:40,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:28:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:28:40,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:40,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:40,680 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:40,680 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,683 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:40,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,683 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:40,683 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,685 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:40,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:40,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:28:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:28:40,688 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:28:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:40,689 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:28:40,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:28:40,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:40,690 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 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:28:40,690 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:40,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 26 times [2018-11-23 12:28:40,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2018-11-23 12:28:41,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {18091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18091#true} is VALID [2018-11-23 12:28:41,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:28:41,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #66#return; {18091#true} is VALID [2018-11-23 12:28:41,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret13 := main(); {18091#true} is VALID [2018-11-23 12:28:41,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {18091#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18093#(= main_~i~1 0)} is VALID [2018-11-23 12:28:41,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {18093#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18093#(= main_~i~1 0)} is VALID [2018-11-23 12:28:41,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {18093#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18094#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {18094#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18094#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {18094#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18095#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {18095#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18095#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {18095#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18096#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {18096#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18096#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {18096#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18097#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {18097#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18097#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {18097#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18098#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {18098#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18098#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {18098#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18099#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {18099#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18099#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {18099#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18100#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {18100#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18100#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {18100#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18101#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {18101#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18101#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {18101#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18102#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {18102#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18102#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {18102#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18103#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {18103#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18103#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {18103#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18104#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {18104#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18104#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,257 INFO L273 TraceCheckUtils]: 29: Hoare triple {18104#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18105#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {18105#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18105#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {18105#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18106#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {18106#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18106#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {18106#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18107#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {18107#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18107#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {18107#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18108#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,261 INFO L273 TraceCheckUtils]: 36: Hoare triple {18108#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18108#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,262 INFO L273 TraceCheckUtils]: 37: Hoare triple {18108#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18109#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {18109#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18109#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,263 INFO L273 TraceCheckUtils]: 39: Hoare triple {18109#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18110#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {18110#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18110#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {18110#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18111#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,265 INFO L273 TraceCheckUtils]: 42: Hoare triple {18111#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18111#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {18111#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18112#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {18112#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18112#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {18112#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18113#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,268 INFO L273 TraceCheckUtils]: 46: Hoare triple {18113#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18113#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {18113#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18114#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {18114#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18114#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {18114#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18115#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {18115#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18115#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {18115#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18116#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {18116#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18116#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,272 INFO L273 TraceCheckUtils]: 53: Hoare triple {18116#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18117#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {18117#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18117#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {18117#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18118#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {18118#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18118#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {18118#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18119#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {18119#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18119#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {18119#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18120#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,276 INFO L273 TraceCheckUtils]: 60: Hoare triple {18120#(<= main_~i~1 27)} assume !(~i~1 < 100); {18092#false} is VALID [2018-11-23 12:28:41,277 INFO L256 TraceCheckUtils]: 61: Hoare triple {18092#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {18091#true} is VALID [2018-11-23 12:28:41,277 INFO L273 TraceCheckUtils]: 62: Hoare triple {18091#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; {18091#true} is VALID [2018-11-23 12:28:41,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 71: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 73: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 74: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 75: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 76: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {18091#true} assume !(~i~0 < 100); {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {18091#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 81: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {18091#true} {18092#false} #70#return; {18092#false} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {18092#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:28:41,280 INFO L256 TraceCheckUtils]: 84: Hoare triple {18092#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 85: Hoare triple {18091#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; {18091#true} is VALID [2018-11-23 12:28:41,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 87: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 88: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 89: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 90: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 91: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 92: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 93: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 94: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,281 INFO L273 TraceCheckUtils]: 95: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 96: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 97: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 98: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 99: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 100: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 101: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 102: Hoare triple {18091#true} assume !(~i~0 < 100); {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 103: Hoare triple {18091#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18091#true} is VALID [2018-11-23 12:28:41,282 INFO L273 TraceCheckUtils]: 104: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:28:41,283 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {18091#true} {18092#false} #72#return; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 106: Hoare triple {18092#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 107: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 108: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 109: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 110: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 111: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 112: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 113: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,283 INFO L273 TraceCheckUtils]: 114: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 115: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 116: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 117: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 118: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 119: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 120: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 121: Hoare triple {18092#false} assume !(~i~2 < 99); {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L273 TraceCheckUtils]: 122: Hoare triple {18092#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:28:41,284 INFO L256 TraceCheckUtils]: 123: Hoare triple {18092#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 124: Hoare triple {18091#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; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 125: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 126: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 127: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 128: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 129: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 130: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 131: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 132: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,285 INFO L273 TraceCheckUtils]: 133: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 134: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 135: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 136: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 137: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 138: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 139: Hoare triple {18091#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 140: Hoare triple {18091#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 141: Hoare triple {18091#true} assume !(~i~0 < 100); {18091#true} is VALID [2018-11-23 12:28:41,286 INFO L273 TraceCheckUtils]: 142: Hoare triple {18091#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18091#true} is VALID [2018-11-23 12:28:41,287 INFO L273 TraceCheckUtils]: 143: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:28:41,287 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {18091#true} {18092#false} #74#return; {18092#false} is VALID [2018-11-23 12:28:41,287 INFO L273 TraceCheckUtils]: 145: Hoare triple {18092#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {18092#false} is VALID [2018-11-23 12:28:41,287 INFO L273 TraceCheckUtils]: 146: Hoare triple {18092#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {18092#false} is VALID [2018-11-23 12:28:41,287 INFO L273 TraceCheckUtils]: 147: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2018-11-23 12:28:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:41,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:41,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:41,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:41,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:41,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2018-11-23 12:28:41,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {18091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18091#true} is VALID [2018-11-23 12:28:41,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:28:41,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #66#return; {18091#true} is VALID [2018-11-23 12:28:41,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret13 := main(); {18091#true} is VALID [2018-11-23 12:28:41,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {18091#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18139#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:41,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {18139#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18139#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:41,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {18139#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18094#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {18094#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18094#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {18094#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18095#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {18095#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18095#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {18095#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18096#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {18096#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18096#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {18096#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18097#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {18097#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18097#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {18097#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18098#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {18098#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18098#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {18098#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18099#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {18099#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18099#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {18099#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18100#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {18100#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18100#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {18100#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18101#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {18101#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18101#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {18101#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18102#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {18102#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18102#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {18102#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18103#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {18103#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18103#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {18103#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18104#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {18104#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18104#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {18104#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18105#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {18105#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18105#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {18105#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18106#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {18106#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18106#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {18106#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18107#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {18107#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18107#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {18107#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18108#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {18108#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18108#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {18108#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18109#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {18109#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18109#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {18109#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18110#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {18110#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18110#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {18110#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18111#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {18111#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18111#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {18111#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18112#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {18112#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18112#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {18112#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18113#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {18113#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18113#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {18113#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18114#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {18114#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18114#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {18114#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18115#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {18115#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18115#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {18115#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18116#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {18116#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18116#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,890 INFO L273 TraceCheckUtils]: 53: Hoare triple {18116#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18117#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {18117#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18117#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,891 INFO L273 TraceCheckUtils]: 55: Hoare triple {18117#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18118#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,892 INFO L273 TraceCheckUtils]: 56: Hoare triple {18118#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18118#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {18118#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18119#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {18119#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18119#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,894 INFO L273 TraceCheckUtils]: 59: Hoare triple {18119#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {18120#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,895 INFO L273 TraceCheckUtils]: 60: Hoare triple {18120#(<= main_~i~1 27)} assume !(~i~1 < 100); {18092#false} is VALID [2018-11-23 12:28:41,895 INFO L256 TraceCheckUtils]: 61: Hoare triple {18092#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {18092#false} is VALID [2018-11-23 12:28:41,895 INFO L273 TraceCheckUtils]: 62: Hoare triple {18092#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; {18092#false} is VALID [2018-11-23 12:28:41,895 INFO L273 TraceCheckUtils]: 63: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,895 INFO L273 TraceCheckUtils]: 64: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,896 INFO L273 TraceCheckUtils]: 65: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,896 INFO L273 TraceCheckUtils]: 66: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,896 INFO L273 TraceCheckUtils]: 67: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,896 INFO L273 TraceCheckUtils]: 68: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 70: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 73: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 74: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,897 INFO L273 TraceCheckUtils]: 75: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 76: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 78: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 79: Hoare triple {18092#false} assume !(~i~0 < 100); {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {18092#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 81: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {18092#false} {18092#false} #70#return; {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L273 TraceCheckUtils]: 83: Hoare triple {18092#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:28:41,898 INFO L256 TraceCheckUtils]: 84: Hoare triple {18092#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 85: Hoare triple {18092#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; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 86: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 87: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 88: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 89: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 91: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 92: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 93: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,899 INFO L273 TraceCheckUtils]: 94: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 95: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 96: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 97: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 98: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 99: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 100: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 101: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 102: Hoare triple {18092#false} assume !(~i~0 < 100); {18092#false} is VALID [2018-11-23 12:28:41,900 INFO L273 TraceCheckUtils]: 103: Hoare triple {18092#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 104: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {18092#false} {18092#false} #72#return; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 106: Hoare triple {18092#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 107: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 108: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 109: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 110: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 111: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 112: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,901 INFO L273 TraceCheckUtils]: 113: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 114: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 115: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 116: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 117: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 119: Hoare triple {18092#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 120: Hoare triple {18092#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 121: Hoare triple {18092#false} assume !(~i~2 < 99); {18092#false} is VALID [2018-11-23 12:28:41,902 INFO L273 TraceCheckUtils]: 122: Hoare triple {18092#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L256 TraceCheckUtils]: 123: Hoare triple {18092#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 124: Hoare triple {18092#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; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 125: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 126: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 127: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 128: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 129: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 130: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,903 INFO L273 TraceCheckUtils]: 131: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 132: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 133: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 134: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 135: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 136: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 137: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 138: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 139: Hoare triple {18092#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 140: Hoare triple {18092#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18092#false} is VALID [2018-11-23 12:28:41,904 INFO L273 TraceCheckUtils]: 141: Hoare triple {18092#false} assume !(~i~0 < 100); {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L273 TraceCheckUtils]: 142: Hoare triple {18092#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L273 TraceCheckUtils]: 143: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {18092#false} {18092#false} #74#return; {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L273 TraceCheckUtils]: 145: Hoare triple {18092#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L273 TraceCheckUtils]: 146: Hoare triple {18092#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {18092#false} is VALID [2018-11-23 12:28:41,905 INFO L273 TraceCheckUtils]: 147: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2018-11-23 12:28:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:28:41,936 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:28:41,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:41,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:28:42,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:42,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:28:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:28:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:28:42,086 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2018-11-23 12:28:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,565 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-11-23 12:28:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:28:42,566 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:28:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:28:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:28:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:28:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:28:42,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 108 transitions. [2018-11-23 12:28:42,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:42,710 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:28:42,710 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:28:42,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:28:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:28:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-11-23 12:28:42,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:42,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 109 states. [2018-11-23 12:28:42,764 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 109 states. [2018-11-23 12:28:42,764 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 109 states. [2018-11-23 12:28:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,765 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:28:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:28:42,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,766 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 110 states. [2018-11-23 12:28:42,766 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 110 states. [2018-11-23 12:28:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,768 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:28:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:28:42,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:42,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 12:28:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-23 12:28:42,770 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2018-11-23 12:28:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:42,771 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-23 12:28:42,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:28:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-23 12:28:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 12:28:42,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:42,772 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 7, 7, 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:28:42,772 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:42,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash 85718885, now seen corresponding path program 27 times [2018-11-23 12:28:42,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:42,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {19179#true} call ULTIMATE.init(); {19179#true} is VALID [2018-11-23 12:28:43,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {19179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19179#true} is VALID [2018-11-23 12:28:43,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19179#true} {19179#true} #66#return; {19179#true} is VALID [2018-11-23 12:28:43,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {19179#true} call #t~ret13 := main(); {19179#true} is VALID [2018-11-23 12:28:43,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {19179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {19181#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {19181#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {19182#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {19182#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {19183#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {19183#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {19184#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {19184#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {19185#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {19185#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {19186#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {19186#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {19187#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {19187#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {19188#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {19188#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {19189#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {19189#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {19190#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {19190#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {19191#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {19191#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,428 INFO L273 TraceCheckUtils]: 28: Hoare triple {19192#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {19192#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {19193#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {19193#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {19194#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {19194#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {19195#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {19195#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {19196#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {19196#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {19197#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {19197#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {19198#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {19198#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {19199#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {19199#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,438 INFO L273 TraceCheckUtils]: 44: Hoare triple {19200#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {19200#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {19201#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {19201#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,440 INFO L273 TraceCheckUtils]: 48: Hoare triple {19202#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {19202#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {19203#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {19203#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {19204#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,443 INFO L273 TraceCheckUtils]: 53: Hoare triple {19204#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,443 INFO L273 TraceCheckUtils]: 54: Hoare triple {19205#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,444 INFO L273 TraceCheckUtils]: 55: Hoare triple {19205#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {19206#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {19206#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,446 INFO L273 TraceCheckUtils]: 58: Hoare triple {19207#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,446 INFO L273 TraceCheckUtils]: 59: Hoare triple {19207#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {19208#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,448 INFO L273 TraceCheckUtils]: 61: Hoare triple {19208#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,448 INFO L273 TraceCheckUtils]: 62: Hoare triple {19209#(<= main_~i~1 28)} assume !(~i~1 < 100); {19180#false} is VALID [2018-11-23 12:28:43,448 INFO L256 TraceCheckUtils]: 63: Hoare triple {19180#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 64: Hoare triple {19179#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; {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 65: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 66: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 67: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 71: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,450 INFO L273 TraceCheckUtils]: 75: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 76: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 77: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 78: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 79: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 80: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,451 INFO L273 TraceCheckUtils]: 81: Hoare triple {19179#true} assume !(~i~0 < 100); {19179#true} is VALID [2018-11-23 12:28:43,452 INFO L273 TraceCheckUtils]: 82: Hoare triple {19179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19179#true} is VALID [2018-11-23 12:28:43,452 INFO L273 TraceCheckUtils]: 83: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,452 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19179#true} {19180#false} #70#return; {19180#false} is VALID [2018-11-23 12:28:43,452 INFO L273 TraceCheckUtils]: 85: Hoare triple {19180#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19180#false} is VALID [2018-11-23 12:28:43,452 INFO L256 TraceCheckUtils]: 86: Hoare triple {19180#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19179#true} is VALID [2018-11-23 12:28:43,452 INFO L273 TraceCheckUtils]: 87: Hoare triple {19179#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; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 88: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 89: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 90: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 91: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 92: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,453 INFO L273 TraceCheckUtils]: 93: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 94: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 95: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 96: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 97: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 98: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 99: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 100: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 101: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,454 INFO L273 TraceCheckUtils]: 102: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 103: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 104: Hoare triple {19179#true} assume !(~i~0 < 100); {19179#true} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 105: Hoare triple {19179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19179#true} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 106: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,455 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19179#true} {19180#false} #72#return; {19180#false} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 108: Hoare triple {19180#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19180#false} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 109: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 110: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 111: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,455 INFO L273 TraceCheckUtils]: 112: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 113: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 114: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 115: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 116: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 117: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 118: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 119: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 120: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,456 INFO L273 TraceCheckUtils]: 121: Hoare triple {19180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19180#false} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 122: Hoare triple {19180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19180#false} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 123: Hoare triple {19180#false} assume !(~i~2 < 99); {19180#false} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 124: Hoare triple {19180#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {19180#false} is VALID [2018-11-23 12:28:43,457 INFO L256 TraceCheckUtils]: 125: Hoare triple {19180#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 126: Hoare triple {19179#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; {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 127: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 128: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 129: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 130: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,457 INFO L273 TraceCheckUtils]: 131: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 132: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 133: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 134: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 135: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 136: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 137: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 138: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 139: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,458 INFO L273 TraceCheckUtils]: 140: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 141: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 142: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 143: Hoare triple {19179#true} assume !(~i~0 < 100); {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 144: Hoare triple {19179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 145: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,459 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19179#true} {19180#false} #74#return; {19180#false} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 147: Hoare triple {19180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19180#false} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 148: Hoare triple {19180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19180#false} is VALID [2018-11-23 12:28:43,459 INFO L273 TraceCheckUtils]: 149: Hoare triple {19180#false} assume !false; {19180#false} is VALID [2018-11-23 12:28:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:28:43,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:43,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:43,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:43,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:28:43,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:43,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {19179#true} call ULTIMATE.init(); {19179#true} is VALID [2018-11-23 12:28:43,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {19179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19179#true} is VALID [2018-11-23 12:28:43,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19179#true} {19179#true} #66#return; {19179#true} is VALID [2018-11-23 12:28:43,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {19179#true} call #t~ret13 := main(); {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {19179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,899 INFO L273 TraceCheckUtils]: 25: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 30: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 31: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 32: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 42: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 43: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 53: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,902 INFO L273 TraceCheckUtils]: 54: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 58: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 59: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 60: Hoare triple {19179#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 61: Hoare triple {19179#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 62: Hoare triple {19179#true} assume !(~i~1 < 100); {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L256 TraceCheckUtils]: 63: Hoare triple {19179#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19179#true} is VALID [2018-11-23 12:28:43,903 INFO L273 TraceCheckUtils]: 64: Hoare triple {19179#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; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 65: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 66: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 67: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 68: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 69: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 70: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 71: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,904 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 75: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 76: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 77: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 78: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 79: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 80: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 81: Hoare triple {19179#true} assume !(~i~0 < 100); {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 82: Hoare triple {19179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19179#true} is VALID [2018-11-23 12:28:43,905 INFO L273 TraceCheckUtils]: 83: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19179#true} {19179#true} #70#return; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 85: Hoare triple {19179#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L256 TraceCheckUtils]: 86: Hoare triple {19179#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 87: Hoare triple {19179#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; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 88: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 89: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 90: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 91: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,906 INFO L273 TraceCheckUtils]: 92: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 93: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 94: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 95: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 96: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 97: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 98: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,907 INFO L273 TraceCheckUtils]: 99: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 100: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 101: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 102: Hoare triple {19179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 103: Hoare triple {19179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 104: Hoare triple {19179#true} assume !(~i~0 < 100); {19179#true} is VALID [2018-11-23 12:28:43,908 INFO L273 TraceCheckUtils]: 105: Hoare triple {19179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19179#true} is VALID [2018-11-23 12:28:43,909 INFO L273 TraceCheckUtils]: 106: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:28:43,909 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19179#true} {19179#true} #72#return; {19179#true} is VALID [2018-11-23 12:28:43,926 INFO L273 TraceCheckUtils]: 108: Hoare triple {19179#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19537#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:43,927 INFO L273 TraceCheckUtils]: 109: Hoare triple {19537#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19537#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:43,927 INFO L273 TraceCheckUtils]: 110: Hoare triple {19537#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19544#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:43,929 INFO L273 TraceCheckUtils]: 111: Hoare triple {19544#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19544#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:43,930 INFO L273 TraceCheckUtils]: 112: Hoare triple {19544#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19551#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:43,939 INFO L273 TraceCheckUtils]: 113: Hoare triple {19551#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19551#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:43,939 INFO L273 TraceCheckUtils]: 114: Hoare triple {19551#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19558#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:43,943 INFO L273 TraceCheckUtils]: 115: Hoare triple {19558#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19558#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:43,943 INFO L273 TraceCheckUtils]: 116: Hoare triple {19558#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19565#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:43,943 INFO L273 TraceCheckUtils]: 117: Hoare triple {19565#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19565#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:43,944 INFO L273 TraceCheckUtils]: 118: Hoare triple {19565#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19572#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:43,944 INFO L273 TraceCheckUtils]: 119: Hoare triple {19572#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19572#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:43,945 INFO L273 TraceCheckUtils]: 120: Hoare triple {19572#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19579#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:43,945 INFO L273 TraceCheckUtils]: 121: Hoare triple {19579#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19579#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:43,945 INFO L273 TraceCheckUtils]: 122: Hoare triple {19579#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19586#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 123: Hoare triple {19586#(<= main_~i~2 7)} assume !(~i~2 < 99); {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 124: Hoare triple {19180#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L256 TraceCheckUtils]: 125: Hoare triple {19180#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 126: Hoare triple {19180#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; {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 127: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 128: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 129: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,946 INFO L273 TraceCheckUtils]: 130: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 131: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 132: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 133: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 134: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 135: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 136: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 137: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 138: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,947 INFO L273 TraceCheckUtils]: 139: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,948 INFO L273 TraceCheckUtils]: 140: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,948 INFO L273 TraceCheckUtils]: 141: Hoare triple {19180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19180#false} is VALID [2018-11-23 12:28:43,948 INFO L273 TraceCheckUtils]: 142: Hoare triple {19180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#false} is VALID [2018-11-23 12:28:43,948 INFO L273 TraceCheckUtils]: 143: Hoare triple {19180#false} assume !(~i~0 < 100); {19180#false} is VALID [2018-11-23 12:28:43,948 INFO L273 TraceCheckUtils]: 144: Hoare triple {19180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19180#false} is VALID [2018-11-23 12:28:43,949 INFO L273 TraceCheckUtils]: 145: Hoare triple {19180#false} assume true; {19180#false} is VALID [2018-11-23 12:28:43,949 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19180#false} {19180#false} #74#return; {19180#false} is VALID [2018-11-23 12:28:43,949 INFO L273 TraceCheckUtils]: 147: Hoare triple {19180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19180#false} is VALID [2018-11-23 12:28:43,949 INFO L273 TraceCheckUtils]: 148: Hoare triple {19180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19180#false} is VALID [2018-11-23 12:28:43,949 INFO L273 TraceCheckUtils]: 149: Hoare triple {19180#false} assume !false; {19180#false} is VALID [2018-11-23 12:28:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-11-23 12:28:43,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:43,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2018-11-23 12:28:43,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:28:43,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:43,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:28:44,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:44,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:28:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:28:44,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:28:44,249 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2018-11-23 12:28:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,934 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-23 12:28:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:28:44,934 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:28:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:28:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:28:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:28:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:28:44,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 127 transitions. [2018-11-23 12:28:45,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:45,067 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:28:45,067 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:28:45,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:28:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:28:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-23 12:28:45,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:45,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-23 12:28:45,119 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-23 12:28:45,119 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-23 12:28:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,122 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:28:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:45,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,123 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-23 12:28:45,123 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-23 12:28:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,125 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:28:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:45,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:45,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:28:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-23 12:28:45,128 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2018-11-23 12:28:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:45,128 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-23 12:28:45,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:28:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:28:45,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:45,130 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 8, 8, 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:28:45,130 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:45,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1448030523, now seen corresponding path program 28 times [2018-11-23 12:28:45,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:45,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {20304#true} call ULTIMATE.init(); {20304#true} is VALID [2018-11-23 12:28:46,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {20304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20304#true} is VALID [2018-11-23 12:28:46,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20304#true} {20304#true} #66#return; {20304#true} is VALID [2018-11-23 12:28:46,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {20304#true} call #t~ret13 := main(); {20304#true} is VALID [2018-11-23 12:28:46,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {20304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20306#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {20306#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20306#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {20306#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20307#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {20307#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20307#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {20307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20308#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {20308#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20308#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {20308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20309#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {20309#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20309#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {20309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20310#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {20310#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20310#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {20310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20311#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {20311#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20311#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {20311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20312#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {20312#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20312#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {20312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20313#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {20313#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20313#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {20313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20314#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {20314#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20314#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {20314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20315#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {20315#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20315#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {20315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20316#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {20316#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20316#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {20316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20317#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {20317#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20317#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {20317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20318#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,145 INFO L273 TraceCheckUtils]: 30: Hoare triple {20318#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20318#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {20318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20319#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {20319#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20319#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {20319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20320#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {20320#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20320#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {20320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20321#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {20321#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20321#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {20321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20322#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {20322#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20322#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {20322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20323#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {20323#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20323#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {20323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20324#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {20324#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20324#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {20324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20325#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {20325#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20325#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {20325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20326#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {20326#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20326#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {20326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20327#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {20327#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20327#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {20327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20328#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,157 INFO L273 TraceCheckUtils]: 50: Hoare triple {20328#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20328#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {20328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20329#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {20329#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20329#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {20329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20330#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {20330#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20330#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {20330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20331#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {20331#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20331#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,161 INFO L273 TraceCheckUtils]: 57: Hoare triple {20331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20332#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {20332#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20332#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {20332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20333#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {20333#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20333#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {20333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20334#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {20334#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20334#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {20334#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20335#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {20335#(<= main_~i~1 29)} assume !(~i~1 < 100); {20305#false} is VALID [2018-11-23 12:28:46,166 INFO L256 TraceCheckUtils]: 65: Hoare triple {20305#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,166 INFO L273 TraceCheckUtils]: 66: Hoare triple {20304#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; {20304#true} is VALID [2018-11-23 12:28:46,166 INFO L273 TraceCheckUtils]: 67: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,166 INFO L273 TraceCheckUtils]: 68: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,167 INFO L273 TraceCheckUtils]: 69: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,167 INFO L273 TraceCheckUtils]: 70: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,167 INFO L273 TraceCheckUtils]: 71: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,167 INFO L273 TraceCheckUtils]: 72: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,167 INFO L273 TraceCheckUtils]: 73: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 74: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 75: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 76: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 77: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 78: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,168 INFO L273 TraceCheckUtils]: 79: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,169 INFO L273 TraceCheckUtils]: 80: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,169 INFO L273 TraceCheckUtils]: 81: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,169 INFO L273 TraceCheckUtils]: 82: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,169 INFO L273 TraceCheckUtils]: 83: Hoare triple {20304#true} assume !(~i~0 < 100); {20304#true} is VALID [2018-11-23 12:28:46,170 INFO L273 TraceCheckUtils]: 84: Hoare triple {20304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20304#true} is VALID [2018-11-23 12:28:46,170 INFO L273 TraceCheckUtils]: 85: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,170 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20304#true} {20305#false} #70#return; {20305#false} is VALID [2018-11-23 12:28:46,171 INFO L273 TraceCheckUtils]: 87: Hoare triple {20305#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20305#false} is VALID [2018-11-23 12:28:46,171 INFO L256 TraceCheckUtils]: 88: Hoare triple {20305#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,171 INFO L273 TraceCheckUtils]: 89: Hoare triple {20304#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; {20304#true} is VALID [2018-11-23 12:28:46,171 INFO L273 TraceCheckUtils]: 90: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,171 INFO L273 TraceCheckUtils]: 91: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,171 INFO L273 TraceCheckUtils]: 92: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 93: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 94: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 95: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 96: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 97: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 98: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,172 INFO L273 TraceCheckUtils]: 99: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 101: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 102: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 103: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 104: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,173 INFO L273 TraceCheckUtils]: 105: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,174 INFO L273 TraceCheckUtils]: 106: Hoare triple {20304#true} assume !(~i~0 < 100); {20304#true} is VALID [2018-11-23 12:28:46,174 INFO L273 TraceCheckUtils]: 107: Hoare triple {20304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20304#true} is VALID [2018-11-23 12:28:46,174 INFO L273 TraceCheckUtils]: 108: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,174 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20304#true} {20305#false} #72#return; {20305#false} is VALID [2018-11-23 12:28:46,174 INFO L273 TraceCheckUtils]: 110: Hoare triple {20305#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20305#false} is VALID [2018-11-23 12:28:46,174 INFO L273 TraceCheckUtils]: 111: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 112: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 113: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 114: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 115: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 116: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,175 INFO L273 TraceCheckUtils]: 117: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 118: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 119: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 120: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 121: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 122: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,176 INFO L273 TraceCheckUtils]: 123: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L273 TraceCheckUtils]: 124: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L273 TraceCheckUtils]: 125: Hoare triple {20305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L273 TraceCheckUtils]: 126: Hoare triple {20305#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L273 TraceCheckUtils]: 127: Hoare triple {20305#false} assume !(~i~2 < 99); {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L273 TraceCheckUtils]: 128: Hoare triple {20305#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {20305#false} is VALID [2018-11-23 12:28:46,177 INFO L256 TraceCheckUtils]: 129: Hoare triple {20305#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 130: Hoare triple {20304#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; {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 131: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 132: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 133: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 134: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,178 INFO L273 TraceCheckUtils]: 135: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 136: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 137: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 138: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 139: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 140: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,179 INFO L273 TraceCheckUtils]: 141: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 142: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 143: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 144: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 145: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 146: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,180 INFO L273 TraceCheckUtils]: 147: Hoare triple {20304#true} assume !(~i~0 < 100); {20304#true} is VALID [2018-11-23 12:28:46,181 INFO L273 TraceCheckUtils]: 148: Hoare triple {20304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20304#true} is VALID [2018-11-23 12:28:46,181 INFO L273 TraceCheckUtils]: 149: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,181 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20304#true} {20305#false} #74#return; {20305#false} is VALID [2018-11-23 12:28:46,181 INFO L273 TraceCheckUtils]: 151: Hoare triple {20305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20305#false} is VALID [2018-11-23 12:28:46,181 INFO L273 TraceCheckUtils]: 152: Hoare triple {20305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20305#false} is VALID [2018-11-23 12:28:46,181 INFO L273 TraceCheckUtils]: 153: Hoare triple {20305#false} assume !false; {20305#false} is VALID [2018-11-23 12:28:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:28:46,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:46,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:46,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:46,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:46,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:46,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {20304#true} call ULTIMATE.init(); {20304#true} is VALID [2018-11-23 12:28:46,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {20304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20304#true} is VALID [2018-11-23 12:28:46,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20304#true} {20304#true} #66#return; {20304#true} is VALID [2018-11-23 12:28:46,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {20304#true} call #t~ret13 := main(); {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {20304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 41: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 48: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 55: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 58: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 59: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,639 INFO L273 TraceCheckUtils]: 62: Hoare triple {20304#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 63: Hoare triple {20304#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {20304#true} assume !(~i~1 < 100); {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L256 TraceCheckUtils]: 65: Hoare triple {20304#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {20304#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; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 68: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 69: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 70: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 73: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 74: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 75: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 79: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 83: Hoare triple {20304#true} assume !(~i~0 < 100); {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 84: Hoare triple {20304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 85: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20304#true} {20304#true} #70#return; {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 87: Hoare triple {20304#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L256 TraceCheckUtils]: 88: Hoare triple {20304#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 89: Hoare triple {20304#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; {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 90: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,642 INFO L273 TraceCheckUtils]: 91: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 92: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 93: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 94: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 95: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 96: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 97: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 98: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 99: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 100: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,643 INFO L273 TraceCheckUtils]: 101: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 102: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 103: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 104: Hoare triple {20304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 105: Hoare triple {20304#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 106: Hoare triple {20304#true} assume !(~i~0 < 100); {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 107: Hoare triple {20304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 108: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20304#true} {20304#true} #72#return; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 110: Hoare triple {20304#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20304#true} is VALID [2018-11-23 12:28:46,644 INFO L273 TraceCheckUtils]: 111: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 112: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 113: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 114: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 115: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 116: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 117: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 118: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 119: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 120: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,645 INFO L273 TraceCheckUtils]: 121: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 122: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 123: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 124: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 125: Hoare triple {20304#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 126: Hoare triple {20304#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 127: Hoare triple {20304#true} assume !(~i~2 < 99); {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L273 TraceCheckUtils]: 128: Hoare triple {20304#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {20304#true} is VALID [2018-11-23 12:28:46,646 INFO L256 TraceCheckUtils]: 129: Hoare triple {20304#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20304#true} is VALID [2018-11-23 12:28:46,647 INFO L273 TraceCheckUtils]: 130: Hoare triple {20304#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; {20729#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:46,647 INFO L273 TraceCheckUtils]: 131: Hoare triple {20729#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20729#(<= xor_~i~0 1)} is VALID [2018-11-23 12:28:46,648 INFO L273 TraceCheckUtils]: 132: Hoare triple {20729#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20736#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:46,648 INFO L273 TraceCheckUtils]: 133: Hoare triple {20736#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20736#(<= xor_~i~0 2)} is VALID [2018-11-23 12:28:46,648 INFO L273 TraceCheckUtils]: 134: Hoare triple {20736#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20743#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:46,649 INFO L273 TraceCheckUtils]: 135: Hoare triple {20743#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20743#(<= xor_~i~0 3)} is VALID [2018-11-23 12:28:46,649 INFO L273 TraceCheckUtils]: 136: Hoare triple {20743#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20750#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:46,649 INFO L273 TraceCheckUtils]: 137: Hoare triple {20750#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20750#(<= xor_~i~0 4)} is VALID [2018-11-23 12:28:46,650 INFO L273 TraceCheckUtils]: 138: Hoare triple {20750#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20757#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:46,650 INFO L273 TraceCheckUtils]: 139: Hoare triple {20757#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20757#(<= xor_~i~0 5)} is VALID [2018-11-23 12:28:46,651 INFO L273 TraceCheckUtils]: 140: Hoare triple {20757#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20764#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:46,652 INFO L273 TraceCheckUtils]: 141: Hoare triple {20764#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20764#(<= xor_~i~0 6)} is VALID [2018-11-23 12:28:46,652 INFO L273 TraceCheckUtils]: 142: Hoare triple {20764#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20771#(<= xor_~i~0 7)} is VALID [2018-11-23 12:28:46,653 INFO L273 TraceCheckUtils]: 143: Hoare triple {20771#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20771#(<= xor_~i~0 7)} is VALID [2018-11-23 12:28:46,653 INFO L273 TraceCheckUtils]: 144: Hoare triple {20771#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20778#(<= xor_~i~0 8)} is VALID [2018-11-23 12:28:46,654 INFO L273 TraceCheckUtils]: 145: Hoare triple {20778#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20778#(<= xor_~i~0 8)} is VALID [2018-11-23 12:28:46,655 INFO L273 TraceCheckUtils]: 146: Hoare triple {20778#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20785#(<= xor_~i~0 9)} is VALID [2018-11-23 12:28:46,655 INFO L273 TraceCheckUtils]: 147: Hoare triple {20785#(<= xor_~i~0 9)} assume !(~i~0 < 100); {20305#false} is VALID [2018-11-23 12:28:46,655 INFO L273 TraceCheckUtils]: 148: Hoare triple {20305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20305#false} is VALID [2018-11-23 12:28:46,656 INFO L273 TraceCheckUtils]: 149: Hoare triple {20305#false} assume true; {20305#false} is VALID [2018-11-23 12:28:46,656 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20305#false} {20304#true} #74#return; {20305#false} is VALID [2018-11-23 12:28:46,656 INFO L273 TraceCheckUtils]: 151: Hoare triple {20305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20305#false} is VALID [2018-11-23 12:28:46,656 INFO L273 TraceCheckUtils]: 152: Hoare triple {20305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20305#false} is VALID [2018-11-23 12:28:46,656 INFO L273 TraceCheckUtils]: 153: Hoare triple {20305#false} assume !false; {20305#false} is VALID [2018-11-23 12:28:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2018-11-23 12:28:46,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2018-11-23 12:28:46,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:28:46,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:46,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:28:46,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:46,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:28:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:28:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:46,803 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2018-11-23 12:28:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,859 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2018-11-23 12:28:47,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:28:47,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:28:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:28:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:28:47,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 134 transitions. [2018-11-23 12:28:47,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:47,996 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:28:47,996 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:28:47,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:28:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:28:48,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:48,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:28:48,051 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:28:48,052 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:28:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,054 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:28:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:48,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:48,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:48,055 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:28:48,056 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:28:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,058 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:28:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:48,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:48,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:48,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:48,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:28:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-23 12:28:48,060 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2018-11-23 12:28:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:48,060 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-23 12:28:48,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:28:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 12:28:48,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:48,061 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 8, 8, 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:28:48,062 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:48,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash 921802629, now seen corresponding path program 29 times [2018-11-23 12:28:48,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:48,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:48,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:48,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {21466#true} call ULTIMATE.init(); {21466#true} is VALID [2018-11-23 12:28:48,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {21466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21466#true} is VALID [2018-11-23 12:28:48,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:28:48,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21466#true} {21466#true} #66#return; {21466#true} is VALID [2018-11-23 12:28:48,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {21466#true} call #t~ret13 := main(); {21466#true} is VALID [2018-11-23 12:28:48,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {21466#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21468#(= main_~i~1 0)} is VALID [2018-11-23 12:28:48,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {21468#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21468#(= main_~i~1 0)} is VALID [2018-11-23 12:28:48,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {21468#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21469#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:48,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {21469#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21469#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:48,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {21469#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21470#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:48,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {21470#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21470#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:48,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {21470#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21471#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:48,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {21471#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21471#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:48,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {21471#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21472#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:48,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {21472#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21472#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:48,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {21472#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21473#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:48,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {21473#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21473#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:48,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {21473#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21474#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:48,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {21474#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21474#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:48,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {21474#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21475#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:48,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {21475#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21475#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:48,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {21475#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21476#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:48,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {21476#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21476#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:48,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {21476#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21477#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:48,646 INFO L273 TraceCheckUtils]: 24: Hoare triple {21477#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21477#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:48,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {21477#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21478#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:48,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {21478#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21478#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:48,648 INFO L273 TraceCheckUtils]: 27: Hoare triple {21478#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21479#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:48,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {21479#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21479#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:48,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {21479#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21480#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:48,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {21480#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21480#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:48,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {21480#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21481#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:48,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {21481#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21481#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:48,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {21481#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21482#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:48,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {21482#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21482#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:48,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {21482#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21483#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:48,653 INFO L273 TraceCheckUtils]: 36: Hoare triple {21483#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21483#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:48,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {21483#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21484#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:48,654 INFO L273 TraceCheckUtils]: 38: Hoare triple {21484#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21484#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:48,655 INFO L273 TraceCheckUtils]: 39: Hoare triple {21484#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21485#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:48,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {21485#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21485#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:48,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {21485#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21486#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:48,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {21486#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21486#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:48,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {21486#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21487#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:48,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {21487#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21487#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:48,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {21487#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21488#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:48,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {21488#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21488#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:48,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {21488#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21489#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:48,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {21489#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21489#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:48,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {21489#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21490#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:48,662 INFO L273 TraceCheckUtils]: 50: Hoare triple {21490#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21490#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:48,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {21490#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21491#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:48,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {21491#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21491#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:48,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {21491#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21492#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:48,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {21492#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21492#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:48,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {21492#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21493#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:48,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {21493#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21493#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:48,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {21493#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21494#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:48,667 INFO L273 TraceCheckUtils]: 58: Hoare triple {21494#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21494#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:48,667 INFO L273 TraceCheckUtils]: 59: Hoare triple {21494#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21495#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:48,668 INFO L273 TraceCheckUtils]: 60: Hoare triple {21495#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21495#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:48,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {21495#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21496#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:48,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {21496#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21496#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:48,670 INFO L273 TraceCheckUtils]: 63: Hoare triple {21496#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21497#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:48,670 INFO L273 TraceCheckUtils]: 64: Hoare triple {21497#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21497#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:48,671 INFO L273 TraceCheckUtils]: 65: Hoare triple {21497#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21498#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:48,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {21498#(<= main_~i~1 30)} assume !(~i~1 < 100); {21467#false} is VALID [2018-11-23 12:28:48,672 INFO L256 TraceCheckUtils]: 67: Hoare triple {21467#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21466#true} is VALID [2018-11-23 12:28:48,672 INFO L273 TraceCheckUtils]: 68: Hoare triple {21466#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; {21466#true} is VALID [2018-11-23 12:28:48,672 INFO L273 TraceCheckUtils]: 69: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 77: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 78: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 79: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,674 INFO L273 TraceCheckUtils]: 80: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 81: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 82: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 83: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 84: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 85: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,675 INFO L273 TraceCheckUtils]: 86: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,676 INFO L273 TraceCheckUtils]: 87: Hoare triple {21466#true} assume !(~i~0 < 100); {21466#true} is VALID [2018-11-23 12:28:48,676 INFO L273 TraceCheckUtils]: 88: Hoare triple {21466#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21466#true} is VALID [2018-11-23 12:28:48,676 INFO L273 TraceCheckUtils]: 89: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:28:48,676 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21466#true} {21467#false} #70#return; {21467#false} is VALID [2018-11-23 12:28:48,676 INFO L273 TraceCheckUtils]: 91: Hoare triple {21467#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:28:48,676 INFO L256 TraceCheckUtils]: 92: Hoare triple {21467#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 93: Hoare triple {21466#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; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 94: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 95: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 96: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 97: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 98: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 99: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 100: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 101: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,677 INFO L273 TraceCheckUtils]: 102: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 103: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 104: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 105: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 106: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 107: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 108: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 109: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 110: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,678 INFO L273 TraceCheckUtils]: 111: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 112: Hoare triple {21466#true} assume !(~i~0 < 100); {21466#true} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 113: Hoare triple {21466#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21466#true} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 114: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:28:48,679 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21466#true} {21467#false} #72#return; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 116: Hoare triple {21467#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 117: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 118: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 119: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 120: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,679 INFO L273 TraceCheckUtils]: 121: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 122: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 123: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 124: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 125: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 126: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 127: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 128: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 129: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 130: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,680 INFO L273 TraceCheckUtils]: 131: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 132: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 133: Hoare triple {21467#false} assume !(~i~2 < 99); {21467#false} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 134: Hoare triple {21467#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:28:48,681 INFO L256 TraceCheckUtils]: 135: Hoare triple {21467#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 136: Hoare triple {21466#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; {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 137: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 138: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 139: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 140: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,681 INFO L273 TraceCheckUtils]: 141: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 142: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 143: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 144: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 145: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 146: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 147: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 148: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 149: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,682 INFO L273 TraceCheckUtils]: 150: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 151: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 152: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 153: Hoare triple {21466#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 154: Hoare triple {21466#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 155: Hoare triple {21466#true} assume !(~i~0 < 100); {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 156: Hoare triple {21466#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 157: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:28:48,683 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21466#true} {21467#false} #74#return; {21467#false} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 159: Hoare triple {21467#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21467#false} is VALID [2018-11-23 12:28:48,683 INFO L273 TraceCheckUtils]: 160: Hoare triple {21467#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21467#false} is VALID [2018-11-23 12:28:48,684 INFO L273 TraceCheckUtils]: 161: Hoare triple {21467#false} assume !false; {21467#false} is VALID [2018-11-23 12:28:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:28:48,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:48,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:07,441 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:29:07,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:07,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:07,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {21466#true} call ULTIMATE.init(); {21466#true} is VALID [2018-11-23 12:29:07,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {21466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21466#true} {21466#true} #66#return; {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {21466#true} call #t~ret13 := main(); {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {21466#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 40: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 46: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,826 INFO L273 TraceCheckUtils]: 54: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 61: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 62: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 63: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,827 INFO L273 TraceCheckUtils]: 64: Hoare triple {21466#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21466#true} is VALID [2018-11-23 12:29:07,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {21466#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21466#true} is VALID [2018-11-23 12:29:07,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {21466#true} assume !(~i~1 < 100); {21466#true} is VALID [2018-11-23 12:29:07,828 INFO L256 TraceCheckUtils]: 67: Hoare triple {21466#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21466#true} is VALID [2018-11-23 12:29:07,828 INFO L273 TraceCheckUtils]: 68: Hoare triple {21466#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; {21706#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:07,829 INFO L273 TraceCheckUtils]: 69: Hoare triple {21706#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21706#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:07,829 INFO L273 TraceCheckUtils]: 70: Hoare triple {21706#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21713#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:07,830 INFO L273 TraceCheckUtils]: 71: Hoare triple {21713#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21713#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:07,830 INFO L273 TraceCheckUtils]: 72: Hoare triple {21713#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21720#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:07,830 INFO L273 TraceCheckUtils]: 73: Hoare triple {21720#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21720#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:07,831 INFO L273 TraceCheckUtils]: 74: Hoare triple {21720#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21727#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:07,831 INFO L273 TraceCheckUtils]: 75: Hoare triple {21727#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21727#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:07,831 INFO L273 TraceCheckUtils]: 76: Hoare triple {21727#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21734#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:07,832 INFO L273 TraceCheckUtils]: 77: Hoare triple {21734#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21734#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:07,833 INFO L273 TraceCheckUtils]: 78: Hoare triple {21734#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21741#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:07,833 INFO L273 TraceCheckUtils]: 79: Hoare triple {21741#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21741#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:07,834 INFO L273 TraceCheckUtils]: 80: Hoare triple {21741#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21748#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:07,834 INFO L273 TraceCheckUtils]: 81: Hoare triple {21748#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21748#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:07,835 INFO L273 TraceCheckUtils]: 82: Hoare triple {21748#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21755#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:07,836 INFO L273 TraceCheckUtils]: 83: Hoare triple {21755#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21755#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:07,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {21755#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21762#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:07,837 INFO L273 TraceCheckUtils]: 85: Hoare triple {21762#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21762#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:07,838 INFO L273 TraceCheckUtils]: 86: Hoare triple {21762#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21769#(<= xor_~i~0 10)} is VALID [2018-11-23 12:29:07,838 INFO L273 TraceCheckUtils]: 87: Hoare triple {21769#(<= xor_~i~0 10)} assume !(~i~0 < 100); {21467#false} is VALID [2018-11-23 12:29:07,839 INFO L273 TraceCheckUtils]: 88: Hoare triple {21467#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21467#false} is VALID [2018-11-23 12:29:07,839 INFO L273 TraceCheckUtils]: 89: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:29:07,839 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21467#false} {21466#true} #70#return; {21467#false} is VALID [2018-11-23 12:29:07,839 INFO L273 TraceCheckUtils]: 91: Hoare triple {21467#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:29:07,839 INFO L256 TraceCheckUtils]: 92: Hoare triple {21467#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 93: Hoare triple {21467#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; {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 94: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 95: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 96: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 97: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,840 INFO L273 TraceCheckUtils]: 98: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 99: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 100: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 101: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 103: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,841 INFO L273 TraceCheckUtils]: 104: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 105: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 106: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 107: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 108: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 109: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 110: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 111: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 112: Hoare triple {21467#false} assume !(~i~0 < 100); {21467#false} is VALID [2018-11-23 12:29:07,842 INFO L273 TraceCheckUtils]: 113: Hoare triple {21467#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 114: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21467#false} {21467#false} #72#return; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 116: Hoare triple {21467#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 117: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 118: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 119: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 120: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 121: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 122: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,843 INFO L273 TraceCheckUtils]: 123: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 124: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 125: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 126: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 127: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 128: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 129: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 130: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 131: Hoare triple {21467#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21467#false} is VALID [2018-11-23 12:29:07,844 INFO L273 TraceCheckUtils]: 132: Hoare triple {21467#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 133: Hoare triple {21467#false} assume !(~i~2 < 99); {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 134: Hoare triple {21467#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L256 TraceCheckUtils]: 135: Hoare triple {21467#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 136: Hoare triple {21467#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; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 137: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 138: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 139: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 140: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 141: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,845 INFO L273 TraceCheckUtils]: 142: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 143: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 144: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 145: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 146: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 147: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 148: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 149: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 150: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,846 INFO L273 TraceCheckUtils]: 151: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 152: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 153: Hoare triple {21467#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 154: Hoare triple {21467#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 155: Hoare triple {21467#false} assume !(~i~0 < 100); {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 156: Hoare triple {21467#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 157: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21467#false} {21467#false} #74#return; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 159: Hoare triple {21467#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 160: Hoare triple {21467#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21467#false} is VALID [2018-11-23 12:29:07,847 INFO L273 TraceCheckUtils]: 161: Hoare triple {21467#false} assume !false; {21467#false} is VALID [2018-11-23 12:29:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2018-11-23 12:29:07,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2018-11-23 12:29:07,883 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:29:07,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:07,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:29:08,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:08,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:29:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:29:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:29:08,045 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2018-11-23 12:29:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,108 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-11-23 12:29:09,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:29:09,108 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:29:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:29:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:29:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:29:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:29:09,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 138 transitions. [2018-11-23 12:29:09,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:09,248 INFO L225 Difference]: With dead ends: 173 [2018-11-23 12:29:09,248 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:29:09,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:29:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:29:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-23 12:29:09,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:09,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 121 states. [2018-11-23 12:29:09,370 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 121 states. [2018-11-23 12:29:09,370 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 121 states. [2018-11-23 12:29:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,372 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:29:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:29:09,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:09,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:09,373 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 123 states. [2018-11-23 12:29:09,373 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 123 states. [2018-11-23 12:29:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,375 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:29:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:29:09,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:09,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:09,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:09,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:29:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-11-23 12:29:09,378 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2018-11-23 12:29:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:09,378 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-11-23 12:29:09,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:29:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:29:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-23 12:29:09,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:09,380 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 8, 8, 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:09,380 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:09,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 301043269, now seen corresponding path program 30 times [2018-11-23 12:29:09,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:09,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:09,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {22677#true} call ULTIMATE.init(); {22677#true} is VALID [2018-11-23 12:29:09,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {22677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22677#true} is VALID [2018-11-23 12:29:09,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:09,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22677#true} {22677#true} #66#return; {22677#true} is VALID [2018-11-23 12:29:09,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {22677#true} call #t~ret13 := main(); {22677#true} is VALID [2018-11-23 12:29:09,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {22677#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22679#(= main_~i~1 0)} is VALID [2018-11-23 12:29:09,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {22679#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22679#(= main_~i~1 0)} is VALID [2018-11-23 12:29:09,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {22679#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22680#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:09,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {22680#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22680#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:10,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {22680#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22681#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:10,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {22681#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22681#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:10,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {22681#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22682#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:10,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {22682#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22682#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:10,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {22682#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22683#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:10,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {22683#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22683#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:10,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {22683#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22684#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:10,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {22684#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22684#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:10,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {22684#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22685#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:10,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {22685#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22685#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:10,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {22685#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22686#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:10,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {22686#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22686#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:10,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {22686#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22687#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:10,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {22687#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22687#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:10,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {22687#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22688#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:10,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {22688#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22688#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:10,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {22688#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22689#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:10,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {22689#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22689#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:10,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {22689#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22690#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:10,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {22690#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22690#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:10,013 INFO L273 TraceCheckUtils]: 29: Hoare triple {22690#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22691#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:10,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {22691#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22691#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:10,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {22691#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22692#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:10,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {22692#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22692#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:10,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {22692#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22693#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:10,016 INFO L273 TraceCheckUtils]: 34: Hoare triple {22693#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22693#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:10,017 INFO L273 TraceCheckUtils]: 35: Hoare triple {22693#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22694#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:10,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {22694#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22694#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:10,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {22694#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22695#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:10,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {22695#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22695#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:10,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {22695#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22696#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:10,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {22696#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22696#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:10,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {22696#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22697#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:10,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {22697#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22697#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:10,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {22697#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22698#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:10,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {22698#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22698#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:10,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {22698#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22699#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:10,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {22699#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22699#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:10,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {22699#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22700#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:10,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {22700#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22700#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:10,025 INFO L273 TraceCheckUtils]: 49: Hoare triple {22700#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22701#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:10,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {22701#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22701#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:10,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {22701#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22702#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:10,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {22702#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22702#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:10,028 INFO L273 TraceCheckUtils]: 53: Hoare triple {22702#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22703#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:10,028 INFO L273 TraceCheckUtils]: 54: Hoare triple {22703#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22703#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:10,029 INFO L273 TraceCheckUtils]: 55: Hoare triple {22703#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22704#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:10,030 INFO L273 TraceCheckUtils]: 56: Hoare triple {22704#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22704#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:10,030 INFO L273 TraceCheckUtils]: 57: Hoare triple {22704#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22705#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:10,031 INFO L273 TraceCheckUtils]: 58: Hoare triple {22705#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22705#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:10,032 INFO L273 TraceCheckUtils]: 59: Hoare triple {22705#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22706#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:10,032 INFO L273 TraceCheckUtils]: 60: Hoare triple {22706#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22706#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:10,033 INFO L273 TraceCheckUtils]: 61: Hoare triple {22706#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22707#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:10,033 INFO L273 TraceCheckUtils]: 62: Hoare triple {22707#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22707#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:10,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {22707#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22708#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:10,035 INFO L273 TraceCheckUtils]: 64: Hoare triple {22708#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22708#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:10,035 INFO L273 TraceCheckUtils]: 65: Hoare triple {22708#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22709#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:10,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {22709#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22709#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:10,037 INFO L273 TraceCheckUtils]: 67: Hoare triple {22709#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22710#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:10,037 INFO L273 TraceCheckUtils]: 68: Hoare triple {22710#(<= main_~i~1 31)} assume !(~i~1 < 100); {22678#false} is VALID [2018-11-23 12:29:10,038 INFO L256 TraceCheckUtils]: 69: Hoare triple {22678#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22677#true} is VALID [2018-11-23 12:29:10,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {22677#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; {22677#true} is VALID [2018-11-23 12:29:10,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,038 INFO L273 TraceCheckUtils]: 72: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,039 INFO L273 TraceCheckUtils]: 76: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,039 INFO L273 TraceCheckUtils]: 77: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,039 INFO L273 TraceCheckUtils]: 78: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,039 INFO L273 TraceCheckUtils]: 79: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 80: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 81: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 82: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 83: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 84: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,041 INFO L273 TraceCheckUtils]: 86: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,041 INFO L273 TraceCheckUtils]: 87: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,041 INFO L273 TraceCheckUtils]: 88: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,041 INFO L273 TraceCheckUtils]: 89: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,041 INFO L273 TraceCheckUtils]: 90: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {22677#true} assume !(~i~0 < 100); {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 92: Hoare triple {22677#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 93: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22677#true} {22678#false} #70#return; {22678#false} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 95: Hoare triple {22678#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22678#false} is VALID [2018-11-23 12:29:10,042 INFO L256 TraceCheckUtils]: 96: Hoare triple {22678#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 97: Hoare triple {22677#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; {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 98: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,042 INFO L273 TraceCheckUtils]: 99: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 101: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 102: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 103: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 104: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 105: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 106: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 107: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 108: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,043 INFO L273 TraceCheckUtils]: 109: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 111: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 112: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 113: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 114: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 115: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 116: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 117: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 118: Hoare triple {22677#true} assume !(~i~0 < 100); {22677#true} is VALID [2018-11-23 12:29:10,044 INFO L273 TraceCheckUtils]: 119: Hoare triple {22677#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22677#true} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 120: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:10,045 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22677#true} {22678#false} #72#return; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 122: Hoare triple {22678#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 123: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 124: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 125: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 126: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 127: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,045 INFO L273 TraceCheckUtils]: 128: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 129: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 130: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 131: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 132: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 133: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 134: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,046 INFO L273 TraceCheckUtils]: 135: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L273 TraceCheckUtils]: 136: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L273 TraceCheckUtils]: 137: Hoare triple {22678#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L273 TraceCheckUtils]: 138: Hoare triple {22678#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L273 TraceCheckUtils]: 139: Hoare triple {22678#false} assume !(~i~2 < 99); {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L273 TraceCheckUtils]: 140: Hoare triple {22678#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {22678#false} is VALID [2018-11-23 12:29:10,047 INFO L256 TraceCheckUtils]: 141: Hoare triple {22678#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 142: Hoare triple {22677#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; {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 143: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 144: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 145: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 146: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,048 INFO L273 TraceCheckUtils]: 147: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 148: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 149: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 150: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 151: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 152: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 153: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,049 INFO L273 TraceCheckUtils]: 154: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 155: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 156: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 157: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 158: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 159: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 160: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,050 INFO L273 TraceCheckUtils]: 161: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:10,051 INFO L273 TraceCheckUtils]: 162: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:10,051 INFO L273 TraceCheckUtils]: 163: Hoare triple {22677#true} assume !(~i~0 < 100); {22677#true} is VALID [2018-11-23 12:29:10,051 INFO L273 TraceCheckUtils]: 164: Hoare triple {22677#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22677#true} is VALID [2018-11-23 12:29:10,051 INFO L273 TraceCheckUtils]: 165: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:10,051 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22677#true} {22678#false} #74#return; {22678#false} is VALID [2018-11-23 12:29:10,051 INFO L273 TraceCheckUtils]: 167: Hoare triple {22678#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22678#false} is VALID [2018-11-23 12:29:10,052 INFO L273 TraceCheckUtils]: 168: Hoare triple {22678#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22678#false} is VALID [2018-11-23 12:29:10,052 INFO L273 TraceCheckUtils]: 169: Hoare triple {22678#false} assume !false; {22678#false} is VALID [2018-11-23 12:29:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:29:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:10,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:10,086 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:14,082 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:29:14,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:14,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:14,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {22677#true} call ULTIMATE.init(); {22677#true} is VALID [2018-11-23 12:29:14,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {22677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22677#true} is VALID [2018-11-23 12:29:14,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:14,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22677#true} {22677#true} #66#return; {22677#true} is VALID [2018-11-23 12:29:14,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {22677#true} call #t~ret13 := main(); {22677#true} is VALID [2018-11-23 12:29:14,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {22677#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22677#true} is VALID [2018-11-23 12:29:14,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 27: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 29: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,715 INFO L273 TraceCheckUtils]: 47: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 55: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,716 INFO L273 TraceCheckUtils]: 57: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 62: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 64: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 65: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,717 INFO L273 TraceCheckUtils]: 66: Hoare triple {22677#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {22677#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {22677#true} assume !(~i~1 < 100); {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L256 TraceCheckUtils]: 69: Hoare triple {22677#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 70: Hoare triple {22677#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; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 71: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 72: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 74: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 81: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 83: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 84: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 85: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,719 INFO L273 TraceCheckUtils]: 86: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 87: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {22677#true} assume !(~i~0 < 100); {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 92: Hoare triple {22677#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22677#true} {22677#true} #70#return; {22677#true} is VALID [2018-11-23 12:29:14,720 INFO L273 TraceCheckUtils]: 95: Hoare triple {22677#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L256 TraceCheckUtils]: 96: Hoare triple {22677#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {22677#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; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 99: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 100: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 101: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 102: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 103: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 104: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,721 INFO L273 TraceCheckUtils]: 105: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 106: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 109: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 110: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 111: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 112: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 113: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 114: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,722 INFO L273 TraceCheckUtils]: 115: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L273 TraceCheckUtils]: 116: Hoare triple {22677#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {22677#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L273 TraceCheckUtils]: 118: Hoare triple {22677#true} assume !(~i~0 < 100); {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L273 TraceCheckUtils]: 119: Hoare triple {22677#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L273 TraceCheckUtils]: 120: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:29:14,723 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22677#true} {22677#true} #72#return; {22677#true} is VALID [2018-11-23 12:29:14,724 INFO L273 TraceCheckUtils]: 122: Hoare triple {22677#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23080#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:14,724 INFO L273 TraceCheckUtils]: 123: Hoare triple {23080#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23080#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:14,725 INFO L273 TraceCheckUtils]: 124: Hoare triple {23080#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23087#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:14,725 INFO L273 TraceCheckUtils]: 125: Hoare triple {23087#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23087#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:14,725 INFO L273 TraceCheckUtils]: 126: Hoare triple {23087#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23094#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:14,726 INFO L273 TraceCheckUtils]: 127: Hoare triple {23094#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23094#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:14,726 INFO L273 TraceCheckUtils]: 128: Hoare triple {23094#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23101#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:14,726 INFO L273 TraceCheckUtils]: 129: Hoare triple {23101#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23101#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:14,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {23101#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23108#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:14,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {23108#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23108#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:14,728 INFO L273 TraceCheckUtils]: 132: Hoare triple {23108#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23115#(<= main_~i~2 5)} is VALID [2018-11-23 12:29:14,729 INFO L273 TraceCheckUtils]: 133: Hoare triple {23115#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23115#(<= main_~i~2 5)} is VALID [2018-11-23 12:29:14,729 INFO L273 TraceCheckUtils]: 134: Hoare triple {23115#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23122#(<= main_~i~2 6)} is VALID [2018-11-23 12:29:14,730 INFO L273 TraceCheckUtils]: 135: Hoare triple {23122#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23122#(<= main_~i~2 6)} is VALID [2018-11-23 12:29:14,731 INFO L273 TraceCheckUtils]: 136: Hoare triple {23122#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23129#(<= main_~i~2 7)} is VALID [2018-11-23 12:29:14,731 INFO L273 TraceCheckUtils]: 137: Hoare triple {23129#(<= main_~i~2 7)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23129#(<= main_~i~2 7)} is VALID [2018-11-23 12:29:14,732 INFO L273 TraceCheckUtils]: 138: Hoare triple {23129#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23136#(<= main_~i~2 8)} is VALID [2018-11-23 12:29:14,733 INFO L273 TraceCheckUtils]: 139: Hoare triple {23136#(<= main_~i~2 8)} assume !(~i~2 < 99); {22678#false} is VALID [2018-11-23 12:29:14,733 INFO L273 TraceCheckUtils]: 140: Hoare triple {22678#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {22678#false} is VALID [2018-11-23 12:29:14,733 INFO L256 TraceCheckUtils]: 141: Hoare triple {22678#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22678#false} is VALID [2018-11-23 12:29:14,733 INFO L273 TraceCheckUtils]: 142: Hoare triple {22678#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; {22678#false} is VALID [2018-11-23 12:29:14,733 INFO L273 TraceCheckUtils]: 143: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 144: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 145: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 146: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 147: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 148: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,734 INFO L273 TraceCheckUtils]: 149: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 150: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 151: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 152: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 153: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 154: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,735 INFO L273 TraceCheckUtils]: 155: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,736 INFO L273 TraceCheckUtils]: 156: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,736 INFO L273 TraceCheckUtils]: 157: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,736 INFO L273 TraceCheckUtils]: 158: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,736 INFO L273 TraceCheckUtils]: 159: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,736 INFO L273 TraceCheckUtils]: 160: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 161: Hoare triple {22678#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 162: Hoare triple {22678#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 163: Hoare triple {22678#false} assume !(~i~0 < 100); {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 164: Hoare triple {22678#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 165: Hoare triple {22678#false} assume true; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22678#false} {22678#false} #74#return; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 167: Hoare triple {22678#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 168: Hoare triple {22678#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22678#false} is VALID [2018-11-23 12:29:14,737 INFO L273 TraceCheckUtils]: 169: Hoare triple {22678#false} assume !false; {22678#false} is VALID [2018-11-23 12:29:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2018-11-23 12:29:14,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:14,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2018-11-23 12:29:14,771 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:29:14,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:14,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:29:14,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:14,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:29:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:29:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:29:14,903 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2018-11-23 12:29:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,294 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-11-23 12:29:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:29:16,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:29:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:29:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:29:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:29:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:29:16,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 135 transitions. [2018-11-23 12:29:16,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:16,432 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:29:16,432 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:29:16,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:29:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:29:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-23 12:29:16,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:16,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 125 states. [2018-11-23 12:29:16,510 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 125 states. [2018-11-23 12:29:16,510 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 125 states. [2018-11-23 12:29:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,513 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:29:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:29:16,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,514 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 127 states. [2018-11-23 12:29:16,514 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 127 states. [2018-11-23 12:29:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,517 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:29:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:29:16,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:16,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:29:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:29:16,520 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2018-11-23 12:29:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:16,520 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:29:16,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:29:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:29:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:29:16,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:16,522 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 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:16,522 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:16,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 31 times [2018-11-23 12:29:16,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:16,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {23935#true} call ULTIMATE.init(); {23935#true} is VALID [2018-11-23 12:29:17,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {23935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23935#true} is VALID [2018-11-23 12:29:17,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:29:17,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23935#true} {23935#true} #66#return; {23935#true} is VALID [2018-11-23 12:29:17,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {23935#true} call #t~ret13 := main(); {23935#true} is VALID [2018-11-23 12:29:17,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {23935#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23937#(= main_~i~1 0)} is VALID [2018-11-23 12:29:17,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {23937#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23937#(= main_~i~1 0)} is VALID [2018-11-23 12:29:17,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {23937#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23938#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {23938#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23938#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {23938#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23939#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {23939#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23939#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {23939#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23940#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:17,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {23940#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23940#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:17,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {23940#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23941#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:17,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {23941#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23941#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:17,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {23941#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23942#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:17,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {23942#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23942#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:17,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {23942#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23943#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:17,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {23943#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23943#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:17,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {23943#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23944#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:17,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {23944#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23944#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:17,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {23944#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23945#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:17,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {23945#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23945#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:17,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {23945#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23946#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:17,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {23946#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23946#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:17,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {23946#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23947#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:17,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {23947#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23947#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:17,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {23947#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23948#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:17,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {23948#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23948#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:17,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {23948#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23949#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:17,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {23949#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23949#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:17,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {23949#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23950#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:17,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {23950#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23950#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:17,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {23950#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23951#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:17,261 INFO L273 TraceCheckUtils]: 34: Hoare triple {23951#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23951#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:17,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {23951#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23952#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:17,262 INFO L273 TraceCheckUtils]: 36: Hoare triple {23952#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23952#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:17,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {23952#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23953#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:17,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {23953#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23953#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:17,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {23953#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23954#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:17,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {23954#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23954#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:17,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {23954#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23955#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:17,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {23955#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23955#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:17,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {23955#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23956#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:17,267 INFO L273 TraceCheckUtils]: 44: Hoare triple {23956#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23956#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:17,268 INFO L273 TraceCheckUtils]: 45: Hoare triple {23956#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23957#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:17,268 INFO L273 TraceCheckUtils]: 46: Hoare triple {23957#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23957#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:17,269 INFO L273 TraceCheckUtils]: 47: Hoare triple {23957#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23958#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:17,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {23958#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23958#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:17,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {23958#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23959#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:17,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {23959#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23959#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:17,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {23959#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23960#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:17,272 INFO L273 TraceCheckUtils]: 52: Hoare triple {23960#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23960#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:17,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {23960#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23961#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:17,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {23961#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23961#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:17,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {23961#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23962#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:17,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {23962#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23962#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:17,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {23962#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23963#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:17,276 INFO L273 TraceCheckUtils]: 58: Hoare triple {23963#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23963#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:17,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {23963#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23964#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:17,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {23964#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23964#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:17,278 INFO L273 TraceCheckUtils]: 61: Hoare triple {23964#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23965#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:17,278 INFO L273 TraceCheckUtils]: 62: Hoare triple {23965#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23965#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:17,279 INFO L273 TraceCheckUtils]: 63: Hoare triple {23965#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23966#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:17,279 INFO L273 TraceCheckUtils]: 64: Hoare triple {23966#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23966#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:17,280 INFO L273 TraceCheckUtils]: 65: Hoare triple {23966#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23967#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:17,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {23967#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23967#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:17,281 INFO L273 TraceCheckUtils]: 67: Hoare triple {23967#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23968#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:17,282 INFO L273 TraceCheckUtils]: 68: Hoare triple {23968#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23968#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:17,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {23968#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23969#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:17,283 INFO L273 TraceCheckUtils]: 70: Hoare triple {23969#(<= main_~i~1 32)} assume !(~i~1 < 100); {23936#false} is VALID [2018-11-23 12:29:17,284 INFO L256 TraceCheckUtils]: 71: Hoare triple {23936#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23935#true} is VALID [2018-11-23 12:29:17,284 INFO L273 TraceCheckUtils]: 72: Hoare triple {23935#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; {23935#true} is VALID [2018-11-23 12:29:17,284 INFO L273 TraceCheckUtils]: 73: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,284 INFO L273 TraceCheckUtils]: 74: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,284 INFO L273 TraceCheckUtils]: 75: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,284 INFO L273 TraceCheckUtils]: 76: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,285 INFO L273 TraceCheckUtils]: 77: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,285 INFO L273 TraceCheckUtils]: 78: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,285 INFO L273 TraceCheckUtils]: 80: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,285 INFO L273 TraceCheckUtils]: 81: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,286 INFO L273 TraceCheckUtils]: 82: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,286 INFO L273 TraceCheckUtils]: 83: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,286 INFO L273 TraceCheckUtils]: 84: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,286 INFO L273 TraceCheckUtils]: 85: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,286 INFO L273 TraceCheckUtils]: 86: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 87: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 88: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 89: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 90: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 91: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,287 INFO L273 TraceCheckUtils]: 92: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,288 INFO L273 TraceCheckUtils]: 93: Hoare triple {23935#true} assume !(~i~0 < 100); {23935#true} is VALID [2018-11-23 12:29:17,288 INFO L273 TraceCheckUtils]: 94: Hoare triple {23935#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23935#true} is VALID [2018-11-23 12:29:17,288 INFO L273 TraceCheckUtils]: 95: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:29:17,288 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23935#true} {23936#false} #70#return; {23936#false} is VALID [2018-11-23 12:29:17,288 INFO L273 TraceCheckUtils]: 97: Hoare triple {23936#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:29:17,288 INFO L256 TraceCheckUtils]: 98: Hoare triple {23936#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 99: Hoare triple {23935#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; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 100: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 101: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 102: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 103: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 104: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 105: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 106: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 107: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,289 INFO L273 TraceCheckUtils]: 108: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 109: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 110: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 111: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 112: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 113: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 114: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 115: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 116: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,290 INFO L273 TraceCheckUtils]: 117: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 118: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 119: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 120: Hoare triple {23935#true} assume !(~i~0 < 100); {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 121: Hoare triple {23935#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 122: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:29:17,291 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23935#true} {23936#false} #72#return; {23936#false} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 124: Hoare triple {23936#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23936#false} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 125: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 126: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,291 INFO L273 TraceCheckUtils]: 127: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 128: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 129: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 130: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 131: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 132: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 133: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 134: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 135: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,292 INFO L273 TraceCheckUtils]: 136: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 137: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 138: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 139: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 140: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 141: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 142: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 143: Hoare triple {23936#false} assume !(~i~2 < 99); {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 144: Hoare triple {23936#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:29:17,293 INFO L256 TraceCheckUtils]: 145: Hoare triple {23936#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23935#true} is VALID [2018-11-23 12:29:17,293 INFO L273 TraceCheckUtils]: 146: Hoare triple {23935#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; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 147: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 148: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 149: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 150: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 151: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 152: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 153: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 154: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,294 INFO L273 TraceCheckUtils]: 155: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 156: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 157: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 158: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 159: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 160: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 161: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 162: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 163: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 164: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,295 INFO L273 TraceCheckUtils]: 165: Hoare triple {23935#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23935#true} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 166: Hoare triple {23935#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23935#true} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 167: Hoare triple {23935#true} assume !(~i~0 < 100); {23935#true} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 168: Hoare triple {23935#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23935#true} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 169: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:29:17,296 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23935#true} {23936#false} #74#return; {23936#false} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 171: Hoare triple {23936#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23936#false} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 172: Hoare triple {23936#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23936#false} is VALID [2018-11-23 12:29:17,296 INFO L273 TraceCheckUtils]: 173: Hoare triple {23936#false} assume !false; {23936#false} is VALID [2018-11-23 12:29:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:29:17,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:17,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:17,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {23935#true} call ULTIMATE.init(); {23935#true} is VALID [2018-11-23 12:29:17,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {23935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23935#true} is VALID [2018-11-23 12:29:17,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:29:17,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23935#true} {23935#true} #66#return; {23935#true} is VALID [2018-11-23 12:29:17,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {23935#true} call #t~ret13 := main(); {23935#true} is VALID [2018-11-23 12:29:17,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {23935#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23988#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:17,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {23988#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23988#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:17,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {23988#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23938#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {23938#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23938#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {23938#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23939#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {23939#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23939#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {23939#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23940#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:17,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {23940#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23940#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:17,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {23940#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23941#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:17,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {23941#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23941#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:17,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {23941#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23942#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:17,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {23942#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23942#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:17,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {23942#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23943#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:17,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {23943#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23943#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:17,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {23943#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23944#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:17,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {23944#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23944#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:17,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {23944#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23945#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:17,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {23945#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23945#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:17,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {23945#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23946#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:17,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {23946#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23946#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:17,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {23946#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23947#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:17,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {23947#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23947#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:17,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {23947#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23948#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:17,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {23948#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23948#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:17,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {23948#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23949#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:17,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {23949#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23949#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:17,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {23949#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23950#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:17,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {23950#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23950#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:17,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {23950#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23951#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:17,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {23951#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23951#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:17,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {23951#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23952#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:17,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {23952#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23952#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:17,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {23952#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23953#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:17,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {23953#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23953#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:17,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {23953#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23954#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:17,798 INFO L273 TraceCheckUtils]: 40: Hoare triple {23954#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23954#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:17,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {23954#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23955#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:17,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {23955#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23955#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:17,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {23955#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23956#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:17,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {23956#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23956#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:17,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {23956#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23957#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:17,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {23957#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23957#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:17,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {23957#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23958#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:17,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {23958#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23958#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:17,804 INFO L273 TraceCheckUtils]: 49: Hoare triple {23958#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23959#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:17,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {23959#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23959#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:17,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {23959#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23960#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:17,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {23960#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23960#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:17,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {23960#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23961#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:17,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {23961#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23961#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:17,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {23961#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23962#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:17,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {23962#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23962#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:17,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {23962#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23963#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:17,810 INFO L273 TraceCheckUtils]: 58: Hoare triple {23963#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23963#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:17,810 INFO L273 TraceCheckUtils]: 59: Hoare triple {23963#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23964#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:17,811 INFO L273 TraceCheckUtils]: 60: Hoare triple {23964#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23964#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:17,812 INFO L273 TraceCheckUtils]: 61: Hoare triple {23964#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23965#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:17,812 INFO L273 TraceCheckUtils]: 62: Hoare triple {23965#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23965#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:17,813 INFO L273 TraceCheckUtils]: 63: Hoare triple {23965#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23966#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:17,813 INFO L273 TraceCheckUtils]: 64: Hoare triple {23966#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23966#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:17,814 INFO L273 TraceCheckUtils]: 65: Hoare triple {23966#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23967#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:17,815 INFO L273 TraceCheckUtils]: 66: Hoare triple {23967#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23967#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:17,815 INFO L273 TraceCheckUtils]: 67: Hoare triple {23967#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23968#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:17,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {23968#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23968#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:17,817 INFO L273 TraceCheckUtils]: 69: Hoare triple {23968#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23969#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:17,817 INFO L273 TraceCheckUtils]: 70: Hoare triple {23969#(<= main_~i~1 32)} assume !(~i~1 < 100); {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L256 TraceCheckUtils]: 71: Hoare triple {23936#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {23936#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; {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L273 TraceCheckUtils]: 75: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,818 INFO L273 TraceCheckUtils]: 76: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,819 INFO L273 TraceCheckUtils]: 79: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,819 INFO L273 TraceCheckUtils]: 80: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,819 INFO L273 TraceCheckUtils]: 81: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,820 INFO L273 TraceCheckUtils]: 82: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,820 INFO L273 TraceCheckUtils]: 83: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,820 INFO L273 TraceCheckUtils]: 84: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,820 INFO L273 TraceCheckUtils]: 85: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,821 INFO L273 TraceCheckUtils]: 89: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 92: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 93: Hoare triple {23936#false} assume !(~i~0 < 100); {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 94: Hoare triple {23936#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23936#false} is VALID [2018-11-23 12:29:17,822 INFO L273 TraceCheckUtils]: 95: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23936#false} {23936#false} #70#return; {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L273 TraceCheckUtils]: 97: Hoare triple {23936#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L256 TraceCheckUtils]: 98: Hoare triple {23936#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {23936#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; {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,823 INFO L273 TraceCheckUtils]: 101: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 102: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 103: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 104: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,824 INFO L273 TraceCheckUtils]: 107: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 108: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 109: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 110: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 111: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 112: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 113: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,825 INFO L273 TraceCheckUtils]: 114: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 115: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 116: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 117: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 118: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 119: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,826 INFO L273 TraceCheckUtils]: 120: Hoare triple {23936#false} assume !(~i~0 < 100); {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 121: Hoare triple {23936#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 122: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23936#false} {23936#false} #72#return; {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 124: Hoare triple {23936#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 125: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 126: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,827 INFO L273 TraceCheckUtils]: 127: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 128: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 129: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 130: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 131: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 132: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,828 INFO L273 TraceCheckUtils]: 133: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 134: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 135: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 136: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 137: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 138: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 139: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,829 INFO L273 TraceCheckUtils]: 140: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 141: Hoare triple {23936#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 142: Hoare triple {23936#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 143: Hoare triple {23936#false} assume !(~i~2 < 99); {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 144: Hoare triple {23936#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L256 TraceCheckUtils]: 145: Hoare triple {23936#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 146: Hoare triple {23936#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; {23936#false} is VALID [2018-11-23 12:29:17,830 INFO L273 TraceCheckUtils]: 147: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 148: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 149: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 150: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 151: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 152: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,831 INFO L273 TraceCheckUtils]: 153: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 154: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 155: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 156: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 157: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 158: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 159: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,832 INFO L273 TraceCheckUtils]: 160: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 161: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 162: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 163: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 164: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 165: Hoare triple {23936#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 166: Hoare triple {23936#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23936#false} is VALID [2018-11-23 12:29:17,833 INFO L273 TraceCheckUtils]: 167: Hoare triple {23936#false} assume !(~i~0 < 100); {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L273 TraceCheckUtils]: 168: Hoare triple {23936#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L273 TraceCheckUtils]: 169: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23936#false} {23936#false} #74#return; {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L273 TraceCheckUtils]: 171: Hoare triple {23936#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L273 TraceCheckUtils]: 172: Hoare triple {23936#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23936#false} is VALID [2018-11-23 12:29:17,834 INFO L273 TraceCheckUtils]: 173: Hoare triple {23936#false} assume !false; {23936#false} is VALID [2018-11-23 12:29:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:29:17,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:29:17,881 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:29:17,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:17,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:29:18,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:18,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:29:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:29:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:29:18,022 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:29:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:18,967 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:29:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:29:18,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:29:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:29:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:29:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:29:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:29:18,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:29:19,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:19,138 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:29:19,139 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:29:19,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:29:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:29:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:29:19,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:19,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:29:19,205 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:29:19,205 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:29:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,207 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:29:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:29:19,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,208 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:29:19,208 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:29:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,210 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:29:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:29:19,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:19,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:29:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:29:19,212 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:29:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:19,212 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:29:19,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:29:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:29:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:29:19,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:19,213 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 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:19,213 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:19,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 32 times [2018-11-23 12:29:19,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:19,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:19,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:20,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {25208#true} call ULTIMATE.init(); {25208#true} is VALID [2018-11-23 12:29:20,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {25208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25208#true} is VALID [2018-11-23 12:29:20,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:29:20,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25208#true} {25208#true} #66#return; {25208#true} is VALID [2018-11-23 12:29:20,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {25208#true} call #t~ret13 := main(); {25208#true} is VALID [2018-11-23 12:29:20,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {25208#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25210#(= main_~i~1 0)} is VALID [2018-11-23 12:29:20,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {25210#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25210#(= main_~i~1 0)} is VALID [2018-11-23 12:29:20,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {25210#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25211#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:20,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {25211#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25211#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:20,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {25211#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25212#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:20,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {25212#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25212#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:20,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {25212#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25213#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:20,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {25213#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25213#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:20,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {25213#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25214#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:20,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {25214#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25214#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:20,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {25214#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25215#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:20,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {25215#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25215#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:20,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {25215#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25216#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:20,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {25216#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25216#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:20,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {25216#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25217#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:20,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {25217#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25217#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:20,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {25217#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25218#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:20,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {25218#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25218#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:20,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {25218#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25219#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:20,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {25219#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25219#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:20,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {25219#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25220#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:20,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {25220#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25220#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:20,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {25220#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25221#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:20,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {25221#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25221#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:20,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {25221#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25222#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:20,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {25222#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25222#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:20,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {25222#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25223#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:20,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {25223#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25223#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:20,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {25223#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25224#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:20,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {25224#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25224#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:20,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {25224#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25225#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:20,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {25225#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25225#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:20,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {25225#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25226#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:20,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {25226#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25226#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:20,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {25226#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25227#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:20,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {25227#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25227#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:20,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {25227#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25228#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:20,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {25228#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25228#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:20,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {25228#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25229#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:20,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {25229#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25229#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:20,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {25229#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25230#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:20,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {25230#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25230#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:20,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {25230#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25231#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:20,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {25231#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25231#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:20,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {25231#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25232#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:20,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {25232#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25232#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:20,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {25232#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25233#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:20,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {25233#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25233#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:20,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {25233#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25234#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:20,238 INFO L273 TraceCheckUtils]: 54: Hoare triple {25234#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25234#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:20,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {25234#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25235#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:20,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {25235#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25235#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:20,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {25235#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25236#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:20,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {25236#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25236#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:20,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {25236#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25237#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:20,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {25237#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25237#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:20,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {25237#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25238#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:20,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {25238#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25238#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:20,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {25238#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25239#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:20,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {25239#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25239#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:20,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {25239#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25240#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:20,245 INFO L273 TraceCheckUtils]: 66: Hoare triple {25240#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25240#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:20,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {25240#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25241#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:20,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {25241#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25241#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:20,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {25241#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25242#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:20,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {25242#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25242#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:20,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {25242#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25243#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:20,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {25243#(<= main_~i~1 33)} assume !(~i~1 < 100); {25209#false} is VALID [2018-11-23 12:29:20,249 INFO L256 TraceCheckUtils]: 73: Hoare triple {25209#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {25208#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; {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,251 INFO L273 TraceCheckUtils]: 80: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,251 INFO L273 TraceCheckUtils]: 81: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 86: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 87: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 88: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 89: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 90: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 91: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,252 INFO L273 TraceCheckUtils]: 92: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 93: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 94: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 95: Hoare triple {25208#true} assume !(~i~0 < 100); {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 96: Hoare triple {25208#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 97: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25208#true} {25209#false} #70#return; {25209#false} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 99: Hoare triple {25209#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:29:20,253 INFO L256 TraceCheckUtils]: 100: Hoare triple {25209#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 101: Hoare triple {25208#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; {25208#true} is VALID [2018-11-23 12:29:20,253 INFO L273 TraceCheckUtils]: 102: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 103: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 104: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 105: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 106: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 107: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 108: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 109: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 110: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,254 INFO L273 TraceCheckUtils]: 111: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 112: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 113: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 114: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 115: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 116: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 117: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 118: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 119: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 120: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,255 INFO L273 TraceCheckUtils]: 121: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 122: Hoare triple {25208#true} assume !(~i~0 < 100); {25208#true} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 123: Hoare triple {25208#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25208#true} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 124: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:29:20,256 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25208#true} {25209#false} #72#return; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 126: Hoare triple {25209#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 127: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 128: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 129: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 130: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,256 INFO L273 TraceCheckUtils]: 131: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 132: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 133: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 134: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 135: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 136: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 137: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 138: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 139: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 140: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,257 INFO L273 TraceCheckUtils]: 141: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 142: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 143: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 144: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 145: Hoare triple {25209#false} assume !(~i~2 < 99); {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 146: Hoare triple {25209#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:29:20,258 INFO L256 TraceCheckUtils]: 147: Hoare triple {25209#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {25208#true} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 148: Hoare triple {25208#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; {25208#true} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 149: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,258 INFO L273 TraceCheckUtils]: 150: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 151: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 152: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 153: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 154: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 155: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 156: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 157: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 158: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 159: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,259 INFO L273 TraceCheckUtils]: 160: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 161: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 162: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 163: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 164: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 165: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 166: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 167: Hoare triple {25208#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 168: Hoare triple {25208#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 169: Hoare triple {25208#true} assume !(~i~0 < 100); {25208#true} is VALID [2018-11-23 12:29:20,260 INFO L273 TraceCheckUtils]: 170: Hoare triple {25208#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25208#true} is VALID [2018-11-23 12:29:20,261 INFO L273 TraceCheckUtils]: 171: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:29:20,261 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25208#true} {25209#false} #74#return; {25209#false} is VALID [2018-11-23 12:29:20,261 INFO L273 TraceCheckUtils]: 173: Hoare triple {25209#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {25209#false} is VALID [2018-11-23 12:29:20,261 INFO L273 TraceCheckUtils]: 174: Hoare triple {25209#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25209#false} is VALID [2018-11-23 12:29:20,261 INFO L273 TraceCheckUtils]: 175: Hoare triple {25209#false} assume !false; {25209#false} is VALID [2018-11-23 12:29:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:29:20,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:20,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:20,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:20,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:20,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:20,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {25208#true} call ULTIMATE.init(); {25208#true} is VALID [2018-11-23 12:29:20,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {25208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25208#true} is VALID [2018-11-23 12:29:20,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:29:20,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25208#true} {25208#true} #66#return; {25208#true} is VALID [2018-11-23 12:29:20,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {25208#true} call #t~ret13 := main(); {25208#true} is VALID [2018-11-23 12:29:20,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {25208#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25262#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:20,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {25262#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25262#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:20,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {25262#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25211#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:20,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {25211#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25211#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:20,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {25211#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25212#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:20,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {25212#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25212#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:20,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {25212#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25213#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:20,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {25213#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25213#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:20,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {25213#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25214#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:20,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {25214#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25214#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:20,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {25214#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25215#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:20,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {25215#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25215#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:20,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {25215#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25216#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:20,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {25216#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25216#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:20,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {25216#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25217#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:20,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {25217#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25217#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:20,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {25217#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25218#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:20,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {25218#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25218#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:20,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {25218#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25219#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:20,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {25219#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25219#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:20,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {25219#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25220#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:20,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {25220#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25220#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:20,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {25220#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25221#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:20,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {25221#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25221#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:20,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {25221#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25222#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:20,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {25222#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25222#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:20,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {25222#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25223#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:20,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {25223#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25223#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:20,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {25223#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25224#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:20,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {25224#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25224#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:20,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {25224#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25225#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:20,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {25225#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25225#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:20,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {25225#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25226#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:20,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {25226#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25226#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:20,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {25226#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25227#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:20,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {25227#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25227#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:20,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {25227#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25228#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:20,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {25228#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25228#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:20,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {25228#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25229#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:20,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {25229#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25229#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:20,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {25229#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25230#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:20,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {25230#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25230#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:20,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {25230#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25231#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:20,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {25231#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25231#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:20,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {25231#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25232#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:20,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {25232#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25232#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:20,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {25232#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25233#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:20,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {25233#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25233#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:20,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {25233#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25234#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:20,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {25234#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25234#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:20,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {25234#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25235#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:20,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {25235#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25235#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:20,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {25235#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25236#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:20,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {25236#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25236#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:20,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {25236#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25237#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:20,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {25237#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25237#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:20,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {25237#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25238#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:20,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {25238#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25238#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:20,895 INFO L273 TraceCheckUtils]: 63: Hoare triple {25238#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25239#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:20,896 INFO L273 TraceCheckUtils]: 64: Hoare triple {25239#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25239#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:20,896 INFO L273 TraceCheckUtils]: 65: Hoare triple {25239#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25240#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:20,897 INFO L273 TraceCheckUtils]: 66: Hoare triple {25240#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25240#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:20,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {25240#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25241#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:20,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {25241#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25241#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:20,899 INFO L273 TraceCheckUtils]: 69: Hoare triple {25241#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25242#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:20,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {25242#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25242#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:20,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {25242#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25243#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:20,901 INFO L273 TraceCheckUtils]: 72: Hoare triple {25243#(<= main_~i~1 33)} assume !(~i~1 < 100); {25209#false} is VALID [2018-11-23 12:29:20,901 INFO L256 TraceCheckUtils]: 73: Hoare triple {25209#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {25209#false} is VALID [2018-11-23 12:29:20,901 INFO L273 TraceCheckUtils]: 74: Hoare triple {25209#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; {25209#false} is VALID [2018-11-23 12:29:20,901 INFO L273 TraceCheckUtils]: 75: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 76: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 77: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 78: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 79: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 80: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 82: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 83: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 85: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 87: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 89: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 90: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 91: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 92: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 93: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 94: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 95: Hoare triple {25209#false} assume !(~i~0 < 100); {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 96: Hoare triple {25209#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L273 TraceCheckUtils]: 97: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:29:20,904 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25209#false} {25209#false} #70#return; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 99: Hoare triple {25209#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L256 TraceCheckUtils]: 100: Hoare triple {25209#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 101: Hoare triple {25209#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; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 102: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 103: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 104: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 105: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 106: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,905 INFO L273 TraceCheckUtils]: 107: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 108: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 109: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 110: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 111: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 112: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 113: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 114: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 115: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 116: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,906 INFO L273 TraceCheckUtils]: 117: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 118: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 119: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 120: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 121: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 122: Hoare triple {25209#false} assume !(~i~0 < 100); {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 123: Hoare triple {25209#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 124: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25209#false} {25209#false} #72#return; {25209#false} is VALID [2018-11-23 12:29:20,907 INFO L273 TraceCheckUtils]: 126: Hoare triple {25209#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 127: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 128: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 130: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 131: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 132: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 133: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 134: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 135: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,908 INFO L273 TraceCheckUtils]: 136: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 137: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 138: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 139: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 140: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 141: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 142: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 143: Hoare triple {25209#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 144: Hoare triple {25209#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {25209#false} is VALID [2018-11-23 12:29:20,909 INFO L273 TraceCheckUtils]: 145: Hoare triple {25209#false} assume !(~i~2 < 99); {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 146: Hoare triple {25209#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L256 TraceCheckUtils]: 147: Hoare triple {25209#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 148: Hoare triple {25209#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; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 149: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 150: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 151: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 152: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 153: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 154: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,910 INFO L273 TraceCheckUtils]: 155: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 156: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 157: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 158: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 159: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 160: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 161: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 162: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 163: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 164: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,911 INFO L273 TraceCheckUtils]: 165: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 166: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 167: Hoare triple {25209#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 168: Hoare triple {25209#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 169: Hoare triple {25209#false} assume !(~i~0 < 100); {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 170: Hoare triple {25209#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 171: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25209#false} {25209#false} #74#return; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 173: Hoare triple {25209#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 174: Hoare triple {25209#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {25209#false} is VALID [2018-11-23 12:29:20,912 INFO L273 TraceCheckUtils]: 175: Hoare triple {25209#false} assume !false; {25209#false} is VALID [2018-11-23 12:29:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:29:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:20,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:29:20,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:29:20,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:20,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:29:21,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:21,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:29:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:29:21,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:29:21,057 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2018-11-23 12:29:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:21,895 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-11-23 12:29:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:29:21,895 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:29:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:29:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:29:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:29:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:29:21,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 120 transitions. [2018-11-23 12:29:22,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:22,018 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:29:22,018 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:29:22,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:29:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:29:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-23 12:29:22,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:22,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 129 states. [2018-11-23 12:29:22,113 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 129 states. [2018-11-23 12:29:22,113 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 129 states. [2018-11-23 12:29:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:22,115 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:29:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:29:22,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:22,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:22,115 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 130 states. [2018-11-23 12:29:22,115 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 130 states. [2018-11-23 12:29:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:22,117 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:29:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:29:22,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:22,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:22,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:22,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:29:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-23 12:29:22,121 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2018-11-23 12:29:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:22,121 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-23 12:29:22,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:29:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-23 12:29:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:29:22,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:22,122 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 9, 9, 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:22,122 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:22,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1003169303, now seen corresponding path program 33 times [2018-11-23 12:29:22,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:22,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:22,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:23,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:29:23,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {26498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26498#true} is VALID [2018-11-23 12:29:23,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:23,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #66#return; {26498#true} is VALID [2018-11-23 12:29:23,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret13 := main(); {26498#true} is VALID [2018-11-23 12:29:23,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26500#(= main_~i~1 0)} is VALID [2018-11-23 12:29:23,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {26500#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26500#(= main_~i~1 0)} is VALID [2018-11-23 12:29:23,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {26500#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26501#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:23,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {26501#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26501#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:23,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {26501#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26502#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:23,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {26502#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26502#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:23,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {26502#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26503#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:23,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {26503#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26503#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:23,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {26503#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26504#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:23,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {26504#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26504#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:23,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {26504#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26505#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:23,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {26505#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26505#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:23,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {26505#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26506#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:23,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {26506#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26506#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:23,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {26506#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26507#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:23,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {26507#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26507#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:23,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {26507#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26508#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:23,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {26508#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26508#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:23,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {26508#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26509#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:23,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {26509#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26509#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:23,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {26509#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26510#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:23,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {26510#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26510#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:23,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {26510#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26511#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:23,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {26511#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26511#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:23,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {26511#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26512#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:23,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {26512#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26512#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:23,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {26512#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26513#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:23,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {26513#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26513#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:23,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {26513#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26514#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:23,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {26514#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26514#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:23,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {26514#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26515#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:23,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {26515#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26515#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:23,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {26515#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26516#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:23,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {26516#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26516#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:23,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {26516#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26517#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:23,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {26517#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26517#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:23,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {26517#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26518#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:23,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {26518#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26518#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:23,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {26518#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26519#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:23,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {26519#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26519#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:23,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {26519#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26520#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:23,301 INFO L273 TraceCheckUtils]: 46: Hoare triple {26520#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26520#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:23,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {26520#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26521#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:23,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {26521#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26521#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:23,303 INFO L273 TraceCheckUtils]: 49: Hoare triple {26521#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26522#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:23,303 INFO L273 TraceCheckUtils]: 50: Hoare triple {26522#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26522#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:23,304 INFO L273 TraceCheckUtils]: 51: Hoare triple {26522#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26523#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:23,305 INFO L273 TraceCheckUtils]: 52: Hoare triple {26523#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26523#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:23,305 INFO L273 TraceCheckUtils]: 53: Hoare triple {26523#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26524#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:23,306 INFO L273 TraceCheckUtils]: 54: Hoare triple {26524#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26524#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:23,307 INFO L273 TraceCheckUtils]: 55: Hoare triple {26524#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26525#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:23,307 INFO L273 TraceCheckUtils]: 56: Hoare triple {26525#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26525#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:23,308 INFO L273 TraceCheckUtils]: 57: Hoare triple {26525#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26526#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:23,308 INFO L273 TraceCheckUtils]: 58: Hoare triple {26526#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26526#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:23,309 INFO L273 TraceCheckUtils]: 59: Hoare triple {26526#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26527#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:23,310 INFO L273 TraceCheckUtils]: 60: Hoare triple {26527#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26527#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:23,310 INFO L273 TraceCheckUtils]: 61: Hoare triple {26527#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26528#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:23,311 INFO L273 TraceCheckUtils]: 62: Hoare triple {26528#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26528#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:23,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {26528#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26529#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:23,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {26529#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26529#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:23,313 INFO L273 TraceCheckUtils]: 65: Hoare triple {26529#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26530#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:23,313 INFO L273 TraceCheckUtils]: 66: Hoare triple {26530#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26530#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:23,314 INFO L273 TraceCheckUtils]: 67: Hoare triple {26530#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26531#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:23,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {26531#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26531#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:23,315 INFO L273 TraceCheckUtils]: 69: Hoare triple {26531#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26532#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:23,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {26532#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26532#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:23,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {26532#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26533#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:23,317 INFO L273 TraceCheckUtils]: 72: Hoare triple {26533#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26533#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:23,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {26533#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26534#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:23,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {26534#(<= main_~i~1 34)} assume !(~i~1 < 100); {26499#false} is VALID [2018-11-23 12:29:23,319 INFO L256 TraceCheckUtils]: 75: Hoare triple {26499#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:23,319 INFO L273 TraceCheckUtils]: 76: Hoare triple {26498#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; {26498#true} is VALID [2018-11-23 12:29:23,319 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,319 INFO L273 TraceCheckUtils]: 78: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,319 INFO L273 TraceCheckUtils]: 79: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,320 INFO L273 TraceCheckUtils]: 80: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,320 INFO L273 TraceCheckUtils]: 81: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,320 INFO L273 TraceCheckUtils]: 82: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,320 INFO L273 TraceCheckUtils]: 83: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,320 INFO L273 TraceCheckUtils]: 84: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,321 INFO L273 TraceCheckUtils]: 90: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 91: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 92: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 95: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,322 INFO L273 TraceCheckUtils]: 96: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 97: Hoare triple {26498#true} assume !(~i~0 < 100); {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 98: Hoare triple {26498#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 99: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26498#true} {26499#false} #70#return; {26499#false} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 101: Hoare triple {26499#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26499#false} is VALID [2018-11-23 12:29:23,323 INFO L256 TraceCheckUtils]: 102: Hoare triple {26499#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 103: Hoare triple {26498#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; {26498#true} is VALID [2018-11-23 12:29:23,323 INFO L273 TraceCheckUtils]: 104: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 105: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 106: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 107: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 108: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 109: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 110: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 111: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 112: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 113: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,324 INFO L273 TraceCheckUtils]: 114: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 115: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 116: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 117: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 118: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 119: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 120: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 121: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 122: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,325 INFO L273 TraceCheckUtils]: 124: Hoare triple {26498#true} assume !(~i~0 < 100); {26498#true} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 125: Hoare triple {26498#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26498#true} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 126: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:23,326 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26498#true} {26499#false} #72#return; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 128: Hoare triple {26499#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 129: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 130: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 131: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 132: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 133: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,326 INFO L273 TraceCheckUtils]: 134: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 135: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 136: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 137: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 138: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 139: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 140: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 141: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 142: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,327 INFO L273 TraceCheckUtils]: 143: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 144: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 145: Hoare triple {26499#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 146: Hoare triple {26499#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 147: Hoare triple {26499#false} assume !(~i~2 < 99); {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 148: Hoare triple {26499#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {26499#false} is VALID [2018-11-23 12:29:23,328 INFO L256 TraceCheckUtils]: 149: Hoare triple {26499#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 150: Hoare triple {26498#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; {26498#true} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 151: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 152: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,328 INFO L273 TraceCheckUtils]: 153: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 154: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 155: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 156: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 157: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 158: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 159: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 160: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 161: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 162: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,329 INFO L273 TraceCheckUtils]: 163: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 164: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 165: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 166: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 167: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 168: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 169: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 170: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 171: Hoare triple {26498#true} assume !(~i~0 < 100); {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 172: Hoare triple {26498#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26498#true} is VALID [2018-11-23 12:29:23,330 INFO L273 TraceCheckUtils]: 173: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:23,331 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26498#true} {26499#false} #74#return; {26499#false} is VALID [2018-11-23 12:29:23,331 INFO L273 TraceCheckUtils]: 175: Hoare triple {26499#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26499#false} is VALID [2018-11-23 12:29:23,331 INFO L273 TraceCheckUtils]: 176: Hoare triple {26499#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26499#false} is VALID [2018-11-23 12:29:23,331 INFO L273 TraceCheckUtils]: 177: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:29:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:29:23,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:23,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:23,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:23,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:29:23,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:23,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:24,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:29:24,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {26498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26498#true} is VALID [2018-11-23 12:29:24,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:24,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #66#return; {26498#true} is VALID [2018-11-23 12:29:24,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret13 := main(); {26498#true} is VALID [2018-11-23 12:29:24,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26498#true} is VALID [2018-11-23 12:29:24,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,235 INFO L273 TraceCheckUtils]: 35: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 36: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 37: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 61: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 62: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 63: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 64: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 72: Hoare triple {26498#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 73: Hoare triple {26498#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {26498#true} assume !(~i~1 < 100); {26498#true} is VALID [2018-11-23 12:29:24,239 INFO L256 TraceCheckUtils]: 75: Hoare triple {26498#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {26498#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; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 81: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 83: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,240 INFO L273 TraceCheckUtils]: 84: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 85: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 86: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 87: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 88: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 89: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 90: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 91: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 92: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 93: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,241 INFO L273 TraceCheckUtils]: 94: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 96: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 97: Hoare triple {26498#true} assume !(~i~0 < 100); {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 98: Hoare triple {26498#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 99: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26498#true} {26498#true} #70#return; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 101: Hoare triple {26498#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L256 TraceCheckUtils]: 102: Hoare triple {26498#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 103: Hoare triple {26498#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; {26498#true} is VALID [2018-11-23 12:29:24,242 INFO L273 TraceCheckUtils]: 104: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 106: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 107: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 108: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 109: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 110: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 111: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 112: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,243 INFO L273 TraceCheckUtils]: 113: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 114: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 115: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 116: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 117: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 118: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 119: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 120: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 121: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 122: Hoare triple {26498#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26498#true} is VALID [2018-11-23 12:29:24,244 INFO L273 TraceCheckUtils]: 123: Hoare triple {26498#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 124: Hoare triple {26498#true} assume !(~i~0 < 100); {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 125: Hoare triple {26498#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 126: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26498#true} {26498#true} #72#return; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 128: Hoare triple {26498#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 129: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 130: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 131: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 132: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,245 INFO L273 TraceCheckUtils]: 133: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 134: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 135: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 136: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 137: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 138: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 139: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 140: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 141: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 142: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,246 INFO L273 TraceCheckUtils]: 143: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L273 TraceCheckUtils]: 144: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L273 TraceCheckUtils]: 145: Hoare triple {26498#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L273 TraceCheckUtils]: 146: Hoare triple {26498#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L273 TraceCheckUtils]: 147: Hoare triple {26498#true} assume !(~i~2 < 99); {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L273 TraceCheckUtils]: 148: Hoare triple {26498#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {26498#true} is VALID [2018-11-23 12:29:24,247 INFO L256 TraceCheckUtils]: 149: Hoare triple {26498#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26498#true} is VALID [2018-11-23 12:29:24,248 INFO L273 TraceCheckUtils]: 150: Hoare triple {26498#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; {26988#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:24,248 INFO L273 TraceCheckUtils]: 151: Hoare triple {26988#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26988#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:24,248 INFO L273 TraceCheckUtils]: 152: Hoare triple {26988#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26995#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:24,249 INFO L273 TraceCheckUtils]: 153: Hoare triple {26995#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26995#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:24,249 INFO L273 TraceCheckUtils]: 154: Hoare triple {26995#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27002#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:24,250 INFO L273 TraceCheckUtils]: 155: Hoare triple {27002#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27002#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:24,250 INFO L273 TraceCheckUtils]: 156: Hoare triple {27002#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27009#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:24,250 INFO L273 TraceCheckUtils]: 157: Hoare triple {27009#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27009#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:24,251 INFO L273 TraceCheckUtils]: 158: Hoare triple {27009#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27016#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:24,251 INFO L273 TraceCheckUtils]: 159: Hoare triple {27016#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27016#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:24,252 INFO L273 TraceCheckUtils]: 160: Hoare triple {27016#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27023#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:24,253 INFO L273 TraceCheckUtils]: 161: Hoare triple {27023#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27023#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:24,253 INFO L273 TraceCheckUtils]: 162: Hoare triple {27023#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27030#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:24,254 INFO L273 TraceCheckUtils]: 163: Hoare triple {27030#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27030#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:24,254 INFO L273 TraceCheckUtils]: 164: Hoare triple {27030#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27037#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:24,255 INFO L273 TraceCheckUtils]: 165: Hoare triple {27037#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27037#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:24,256 INFO L273 TraceCheckUtils]: 166: Hoare triple {27037#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27044#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:24,256 INFO L273 TraceCheckUtils]: 167: Hoare triple {27044#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27044#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:24,257 INFO L273 TraceCheckUtils]: 168: Hoare triple {27044#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27051#(<= xor_~i~0 10)} is VALID [2018-11-23 12:29:24,257 INFO L273 TraceCheckUtils]: 169: Hoare triple {27051#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27051#(<= xor_~i~0 10)} is VALID [2018-11-23 12:29:24,258 INFO L273 TraceCheckUtils]: 170: Hoare triple {27051#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27058#(<= xor_~i~0 11)} is VALID [2018-11-23 12:29:24,259 INFO L273 TraceCheckUtils]: 171: Hoare triple {27058#(<= xor_~i~0 11)} assume !(~i~0 < 100); {26499#false} is VALID [2018-11-23 12:29:24,259 INFO L273 TraceCheckUtils]: 172: Hoare triple {26499#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26499#false} is VALID [2018-11-23 12:29:24,259 INFO L273 TraceCheckUtils]: 173: Hoare triple {26499#false} assume true; {26499#false} is VALID [2018-11-23 12:29:24,259 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26499#false} {26498#true} #74#return; {26499#false} is VALID [2018-11-23 12:29:24,260 INFO L273 TraceCheckUtils]: 175: Hoare triple {26499#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26499#false} is VALID [2018-11-23 12:29:24,260 INFO L273 TraceCheckUtils]: 176: Hoare triple {26499#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26499#false} is VALID [2018-11-23 12:29:24,260 INFO L273 TraceCheckUtils]: 177: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:29:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2018-11-23 12:29:24,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:29:24,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:29:24,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:24,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:29:24,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:24,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:29:24,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:29:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:29:24,432 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2018-11-23 12:29:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,047 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-11-23 12:29:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:29:26,047 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:29:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:29:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:29:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:29:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:29:26,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 148 transitions. [2018-11-23 12:29:26,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:26,196 INFO L225 Difference]: With dead ends: 189 [2018-11-23 12:29:26,196 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:29:26,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:29:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:29:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-23 12:29:26,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:26,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 133 states. [2018-11-23 12:29:26,587 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 133 states. [2018-11-23 12:29:26,587 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 133 states. [2018-11-23 12:29:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,590 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:29:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:29:26,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:26,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:26,590 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 135 states. [2018-11-23 12:29:26,590 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 135 states. [2018-11-23 12:29:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,593 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:29:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:29:26,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:26,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:26,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:26,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 12:29:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-11-23 12:29:26,596 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2018-11-23 12:29:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:26,596 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-23 12:29:26,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:29:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:29:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-23 12:29:26,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:26,597 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 9, 9, 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:26,597 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:26,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash 457593001, now seen corresponding path program 34 times [2018-11-23 12:29:26,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:26,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:26,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:26,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:28,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {27828#true} call ULTIMATE.init(); {27828#true} is VALID [2018-11-23 12:29:28,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {27828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27828#true} is VALID [2018-11-23 12:29:28,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:28,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27828#true} {27828#true} #66#return; {27828#true} is VALID [2018-11-23 12:29:28,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {27828#true} call #t~ret13 := main(); {27828#true} is VALID [2018-11-23 12:29:28,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {27828#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27830#(= main_~i~1 0)} is VALID [2018-11-23 12:29:28,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {27830#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27830#(= main_~i~1 0)} is VALID [2018-11-23 12:29:28,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {27830#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27831#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:28,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {27831#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27831#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:28,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {27831#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27832#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:28,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {27832#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27832#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:28,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {27832#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27833#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:28,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {27833#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27833#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:28,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {27833#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27834#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:28,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {27834#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27834#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:28,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {27834#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27835#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:28,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {27835#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27835#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:28,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {27835#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27836#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:28,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {27836#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27836#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:28,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {27836#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27837#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:28,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {27837#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27837#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:28,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {27837#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27838#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:28,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {27838#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27838#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:28,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {27838#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27839#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:28,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {27839#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27839#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:28,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {27839#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27840#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:28,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {27840#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27840#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:28,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {27840#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27841#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:28,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {27841#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27841#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:28,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {27841#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27842#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:28,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {27842#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27842#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:28,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {27842#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27843#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:28,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {27843#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27843#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:28,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {27843#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27844#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:28,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {27844#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27844#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:28,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {27844#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27845#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:28,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {27845#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27845#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:28,557 INFO L273 TraceCheckUtils]: 37: Hoare triple {27845#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27846#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:28,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {27846#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27846#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:28,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {27846#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27847#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:28,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {27847#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27847#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:28,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {27847#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27848#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:28,560 INFO L273 TraceCheckUtils]: 42: Hoare triple {27848#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27848#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:28,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {27848#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27849#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:28,561 INFO L273 TraceCheckUtils]: 44: Hoare triple {27849#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27849#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:28,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {27849#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27850#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:28,562 INFO L273 TraceCheckUtils]: 46: Hoare triple {27850#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27850#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:28,563 INFO L273 TraceCheckUtils]: 47: Hoare triple {27850#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27851#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:28,563 INFO L273 TraceCheckUtils]: 48: Hoare triple {27851#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27851#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:28,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {27851#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27852#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:28,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {27852#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27852#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:28,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {27852#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27853#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:28,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {27853#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27853#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:28,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {27853#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27854#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:28,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {27854#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27854#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:28,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {27854#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27855#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:28,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {27855#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27855#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:28,569 INFO L273 TraceCheckUtils]: 57: Hoare triple {27855#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27856#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:28,569 INFO L273 TraceCheckUtils]: 58: Hoare triple {27856#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27856#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:28,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {27856#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27857#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:28,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {27857#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27857#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:28,571 INFO L273 TraceCheckUtils]: 61: Hoare triple {27857#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27858#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:28,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {27858#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27858#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:28,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {27858#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27859#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:28,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {27859#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27859#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:28,574 INFO L273 TraceCheckUtils]: 65: Hoare triple {27859#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27860#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:28,574 INFO L273 TraceCheckUtils]: 66: Hoare triple {27860#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27860#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:28,575 INFO L273 TraceCheckUtils]: 67: Hoare triple {27860#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27861#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:28,576 INFO L273 TraceCheckUtils]: 68: Hoare triple {27861#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27861#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:28,576 INFO L273 TraceCheckUtils]: 69: Hoare triple {27861#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27862#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:28,577 INFO L273 TraceCheckUtils]: 70: Hoare triple {27862#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27862#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:28,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {27862#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27863#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:28,578 INFO L273 TraceCheckUtils]: 72: Hoare triple {27863#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27863#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:28,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {27863#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27864#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:28,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {27864#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27864#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:28,580 INFO L273 TraceCheckUtils]: 75: Hoare triple {27864#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27865#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:28,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {27865#(<= main_~i~1 35)} assume !(~i~1 < 100); {27829#false} is VALID [2018-11-23 12:29:28,581 INFO L256 TraceCheckUtils]: 77: Hoare triple {27829#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {27828#true} is VALID [2018-11-23 12:29:28,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {27828#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; {27828#true} is VALID [2018-11-23 12:29:28,581 INFO L273 TraceCheckUtils]: 79: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,581 INFO L273 TraceCheckUtils]: 80: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 81: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 82: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 83: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 84: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,583 INFO L273 TraceCheckUtils]: 89: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,583 INFO L273 TraceCheckUtils]: 91: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 92: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 93: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 95: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 96: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 98: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 99: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 100: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 101: Hoare triple {27828#true} assume !(~i~0 < 100); {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 102: Hoare triple {27828#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 103: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:28,585 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27828#true} {27829#false} #70#return; {27829#false} is VALID [2018-11-23 12:29:28,585 INFO L273 TraceCheckUtils]: 105: Hoare triple {27829#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27829#false} is VALID [2018-11-23 12:29:28,585 INFO L256 TraceCheckUtils]: 106: Hoare triple {27829#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 107: Hoare triple {27828#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; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 108: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 109: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 110: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 111: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 112: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 113: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 114: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,586 INFO L273 TraceCheckUtils]: 115: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 116: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 117: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 118: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 119: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 120: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 121: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 122: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 123: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 124: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,587 INFO L273 TraceCheckUtils]: 125: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 126: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 127: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 128: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 129: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 130: Hoare triple {27828#true} assume !(~i~0 < 100); {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 131: Hoare triple {27828#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 132: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:28,588 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27828#true} {27829#false} #72#return; {27829#false} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 134: Hoare triple {27829#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27829#false} is VALID [2018-11-23 12:29:28,588 INFO L273 TraceCheckUtils]: 135: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 136: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 137: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 138: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 139: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 140: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 141: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 142: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 143: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 144: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,589 INFO L273 TraceCheckUtils]: 145: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 146: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 147: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 148: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 149: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 150: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 151: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 152: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 153: Hoare triple {27829#false} assume !(~i~2 < 99); {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L273 TraceCheckUtils]: 154: Hoare triple {27829#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {27829#false} is VALID [2018-11-23 12:29:28,590 INFO L256 TraceCheckUtils]: 155: Hoare triple {27829#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 156: Hoare triple {27828#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; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 157: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 158: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 159: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 160: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 161: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 162: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 163: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 164: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,591 INFO L273 TraceCheckUtils]: 165: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 166: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 167: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 168: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 169: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 170: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 171: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 172: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 173: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 174: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,592 INFO L273 TraceCheckUtils]: 175: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 176: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 177: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 178: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 179: Hoare triple {27828#true} assume !(~i~0 < 100); {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 180: Hoare triple {27828#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 181: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:28,593 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27828#true} {27829#false} #74#return; {27829#false} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 183: Hoare triple {27829#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27829#false} is VALID [2018-11-23 12:29:28,593 INFO L273 TraceCheckUtils]: 184: Hoare triple {27829#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27829#false} is VALID [2018-11-23 12:29:28,594 INFO L273 TraceCheckUtils]: 185: Hoare triple {27829#false} assume !false; {27829#false} is VALID [2018-11-23 12:29:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2018-11-23 12:29:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:28,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:28,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:28,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:28,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:28,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:29,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {27828#true} call ULTIMATE.init(); {27828#true} is VALID [2018-11-23 12:29:29,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {27828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27828#true} {27828#true} #66#return; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {27828#true} call #t~ret13 := main(); {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {27828#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 48: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 49: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 50: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 58: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {27828#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 75: Hoare triple {27828#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L273 TraceCheckUtils]: 76: Hoare triple {27828#true} assume !(~i~1 < 100); {27828#true} is VALID [2018-11-23 12:29:29,189 INFO L256 TraceCheckUtils]: 77: Hoare triple {27828#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 78: Hoare triple {27828#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; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 79: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 80: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 81: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 82: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,190 INFO L273 TraceCheckUtils]: 86: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 87: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 88: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 89: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 90: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 91: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 93: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 94: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 95: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,191 INFO L273 TraceCheckUtils]: 96: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 97: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 98: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 99: Hoare triple {27828#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 100: Hoare triple {27828#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 101: Hoare triple {27828#true} assume !(~i~0 < 100); {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 102: Hoare triple {27828#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 103: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27828#true} {27828#true} #70#return; {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L273 TraceCheckUtils]: 105: Hoare triple {27828#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27828#true} is VALID [2018-11-23 12:29:29,192 INFO L256 TraceCheckUtils]: 106: Hoare triple {27828#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {27828#true} is VALID [2018-11-23 12:29:29,193 INFO L273 TraceCheckUtils]: 107: Hoare triple {27828#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; {28190#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:29,193 INFO L273 TraceCheckUtils]: 108: Hoare triple {28190#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28190#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:29,194 INFO L273 TraceCheckUtils]: 109: Hoare triple {28190#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28197#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:29,194 INFO L273 TraceCheckUtils]: 110: Hoare triple {28197#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28197#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:29,195 INFO L273 TraceCheckUtils]: 111: Hoare triple {28197#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28204#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:29,195 INFO L273 TraceCheckUtils]: 112: Hoare triple {28204#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28204#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:29,195 INFO L273 TraceCheckUtils]: 113: Hoare triple {28204#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28211#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:29,196 INFO L273 TraceCheckUtils]: 114: Hoare triple {28211#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28211#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:29,196 INFO L273 TraceCheckUtils]: 115: Hoare triple {28211#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28218#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:29,197 INFO L273 TraceCheckUtils]: 116: Hoare triple {28218#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28218#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:29,197 INFO L273 TraceCheckUtils]: 117: Hoare triple {28218#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28225#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:29,198 INFO L273 TraceCheckUtils]: 118: Hoare triple {28225#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28225#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:29,199 INFO L273 TraceCheckUtils]: 119: Hoare triple {28225#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28232#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:29,199 INFO L273 TraceCheckUtils]: 120: Hoare triple {28232#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28232#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:29,200 INFO L273 TraceCheckUtils]: 121: Hoare triple {28232#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28239#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:29,200 INFO L273 TraceCheckUtils]: 122: Hoare triple {28239#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28239#(<= xor_~i~0 8)} is VALID [2018-11-23 12:29:29,201 INFO L273 TraceCheckUtils]: 123: Hoare triple {28239#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28246#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:29,201 INFO L273 TraceCheckUtils]: 124: Hoare triple {28246#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28246#(<= xor_~i~0 9)} is VALID [2018-11-23 12:29:29,202 INFO L273 TraceCheckUtils]: 125: Hoare triple {28246#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28253#(<= xor_~i~0 10)} is VALID [2018-11-23 12:29:29,203 INFO L273 TraceCheckUtils]: 126: Hoare triple {28253#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28253#(<= xor_~i~0 10)} is VALID [2018-11-23 12:29:29,203 INFO L273 TraceCheckUtils]: 127: Hoare triple {28253#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28260#(<= xor_~i~0 11)} is VALID [2018-11-23 12:29:29,204 INFO L273 TraceCheckUtils]: 128: Hoare triple {28260#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28260#(<= xor_~i~0 11)} is VALID [2018-11-23 12:29:29,205 INFO L273 TraceCheckUtils]: 129: Hoare triple {28260#(<= xor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28267#(<= xor_~i~0 12)} is VALID [2018-11-23 12:29:29,205 INFO L273 TraceCheckUtils]: 130: Hoare triple {28267#(<= xor_~i~0 12)} assume !(~i~0 < 100); {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L273 TraceCheckUtils]: 131: Hoare triple {27829#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L273 TraceCheckUtils]: 132: Hoare triple {27829#false} assume true; {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27829#false} {27828#true} #72#return; {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L273 TraceCheckUtils]: 134: Hoare triple {27829#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L273 TraceCheckUtils]: 135: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,206 INFO L273 TraceCheckUtils]: 136: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,207 INFO L273 TraceCheckUtils]: 137: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,207 INFO L273 TraceCheckUtils]: 138: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,207 INFO L273 TraceCheckUtils]: 139: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,207 INFO L273 TraceCheckUtils]: 140: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,207 INFO L273 TraceCheckUtils]: 141: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 142: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 143: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 144: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 145: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 146: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,208 INFO L273 TraceCheckUtils]: 147: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 148: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 149: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 150: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 151: Hoare triple {27829#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 152: Hoare triple {27829#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 153: Hoare triple {27829#false} assume !(~i~2 < 99); {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L273 TraceCheckUtils]: 154: Hoare triple {27829#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {27829#false} is VALID [2018-11-23 12:29:29,209 INFO L256 TraceCheckUtils]: 155: Hoare triple {27829#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 156: Hoare triple {27829#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; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 157: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 158: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 159: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 160: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 161: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 162: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 163: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 164: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,210 INFO L273 TraceCheckUtils]: 165: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 166: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 167: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 168: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 169: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 170: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 171: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 172: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 173: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 174: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,211 INFO L273 TraceCheckUtils]: 175: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 176: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 177: Hoare triple {27829#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 178: Hoare triple {27829#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 179: Hoare triple {27829#false} assume !(~i~0 < 100); {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 180: Hoare triple {27829#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 181: Hoare triple {27829#false} assume true; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27829#false} {27829#false} #74#return; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 183: Hoare triple {27829#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 184: Hoare triple {27829#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27829#false} is VALID [2018-11-23 12:29:29,212 INFO L273 TraceCheckUtils]: 185: Hoare triple {27829#false} assume !false; {27829#false} is VALID [2018-11-23 12:29:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-11-23 12:29:29,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:29,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2018-11-23 12:29:29,247 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:29:29,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:29,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:29:29,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:29,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:29:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:29:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:29:29,387 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2018-11-23 12:29:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:31,034 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2018-11-23 12:29:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:29:31,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:29:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:29:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:29:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:29:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:29:31,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 152 transitions. [2018-11-23 12:29:31,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:31,189 INFO L225 Difference]: With dead ends: 195 [2018-11-23 12:29:31,190 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:29:31,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:29:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:29:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-23 12:29:31,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:31,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 137 states. [2018-11-23 12:29:31,256 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 137 states. [2018-11-23 12:29:31,256 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 137 states. [2018-11-23 12:29:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:31,258 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:29:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:29:31,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:31,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:31,259 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 139 states. [2018-11-23 12:29:31,259 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 139 states. [2018-11-23 12:29:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:31,261 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:29:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:29:31,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:31,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:31,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:31,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 12:29:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-23 12:29:31,265 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2018-11-23 12:29:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:31,265 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-23 12:29:31,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:29:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:29:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 12:29:31,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:31,266 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 9, 9, 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:31,267 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:31,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1118472855, now seen corresponding path program 35 times [2018-11-23 12:29:31,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:31,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:31,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:31,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:31,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:32,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {29207#true} call ULTIMATE.init(); {29207#true} is VALID [2018-11-23 12:29:32,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {29207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29207#true} is VALID [2018-11-23 12:29:32,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:29:32,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29207#true} {29207#true} #66#return; {29207#true} is VALID [2018-11-23 12:29:32,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {29207#true} call #t~ret13 := main(); {29207#true} is VALID [2018-11-23 12:29:32,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {29207#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29209#(= main_~i~1 0)} is VALID [2018-11-23 12:29:32,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {29209#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29209#(= main_~i~1 0)} is VALID [2018-11-23 12:29:32,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {29209#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29210#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:32,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {29210#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29210#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:32,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {29210#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29211#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:32,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {29211#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29211#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:32,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {29211#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29212#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:32,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {29212#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29212#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:32,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {29212#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29213#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:32,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {29213#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29213#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:32,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {29213#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29214#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:32,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {29214#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29214#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:32,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {29214#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29215#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:32,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {29215#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29215#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:32,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {29215#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29216#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:32,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {29216#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29216#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:32,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {29216#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29217#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:32,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {29217#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29217#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:32,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {29217#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29218#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:32,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {29218#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29218#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:32,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {29218#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29219#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:32,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {29219#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29219#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:32,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {29219#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29220#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:32,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {29220#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29220#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:32,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {29220#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29221#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:32,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {29221#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29221#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:32,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {29221#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29222#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:32,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {29222#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29222#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:32,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {29222#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29223#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:32,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {29223#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29223#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:32,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {29223#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29224#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:32,190 INFO L273 TraceCheckUtils]: 36: Hoare triple {29224#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29224#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:32,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {29224#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29225#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:32,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {29225#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29225#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:32,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {29225#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29226#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:32,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {29226#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29226#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:32,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {29226#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29227#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:32,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {29227#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29227#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:32,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {29227#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29228#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:32,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {29228#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29228#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:32,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {29228#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29229#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:32,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {29229#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29229#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:32,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {29229#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29230#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:32,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {29230#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29230#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:32,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {29230#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29231#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:32,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {29231#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29231#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:32,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {29231#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29232#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:32,200 INFO L273 TraceCheckUtils]: 52: Hoare triple {29232#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29232#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:32,201 INFO L273 TraceCheckUtils]: 53: Hoare triple {29232#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29233#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:32,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {29233#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29233#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:32,202 INFO L273 TraceCheckUtils]: 55: Hoare triple {29233#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29234#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:32,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {29234#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29234#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:32,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {29234#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29235#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:32,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {29235#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29235#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:32,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {29235#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29236#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:32,205 INFO L273 TraceCheckUtils]: 60: Hoare triple {29236#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29236#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:32,206 INFO L273 TraceCheckUtils]: 61: Hoare triple {29236#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29237#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:32,206 INFO L273 TraceCheckUtils]: 62: Hoare triple {29237#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29237#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:32,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {29237#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29238#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:32,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {29238#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29238#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:32,208 INFO L273 TraceCheckUtils]: 65: Hoare triple {29238#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29239#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:32,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {29239#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29239#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:32,209 INFO L273 TraceCheckUtils]: 67: Hoare triple {29239#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29240#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:32,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {29240#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29240#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:32,211 INFO L273 TraceCheckUtils]: 69: Hoare triple {29240#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29241#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:32,211 INFO L273 TraceCheckUtils]: 70: Hoare triple {29241#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29241#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:32,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {29241#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29242#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:32,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {29242#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29242#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:32,213 INFO L273 TraceCheckUtils]: 73: Hoare triple {29242#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29243#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:32,214 INFO L273 TraceCheckUtils]: 74: Hoare triple {29243#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29243#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:32,214 INFO L273 TraceCheckUtils]: 75: Hoare triple {29243#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29244#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:32,215 INFO L273 TraceCheckUtils]: 76: Hoare triple {29244#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29244#(<= main_~i~1 35)} is VALID [2018-11-23 12:29:32,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {29244#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29245#(<= main_~i~1 36)} is VALID [2018-11-23 12:29:32,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {29245#(<= main_~i~1 36)} assume !(~i~1 < 100); {29208#false} is VALID [2018-11-23 12:29:32,217 INFO L256 TraceCheckUtils]: 79: Hoare triple {29208#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {29207#true} is VALID [2018-11-23 12:29:32,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {29207#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; {29207#true} is VALID [2018-11-23 12:29:32,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 87: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 88: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,219 INFO L273 TraceCheckUtils]: 91: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,219 INFO L273 TraceCheckUtils]: 92: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,219 INFO L273 TraceCheckUtils]: 93: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,219 INFO L273 TraceCheckUtils]: 94: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 97: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 99: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 100: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,220 INFO L273 TraceCheckUtils]: 101: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 103: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 104: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 105: Hoare triple {29207#true} assume !(~i~0 < 100); {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 106: Hoare triple {29207#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29207#true} is VALID [2018-11-23 12:29:32,221 INFO L273 TraceCheckUtils]: 107: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29207#true} {29208#false} #70#return; {29208#false} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 109: Hoare triple {29208#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:29:32,222 INFO L256 TraceCheckUtils]: 110: Hoare triple {29208#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {29207#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; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 113: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 114: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,222 INFO L273 TraceCheckUtils]: 116: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 117: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 124: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,223 INFO L273 TraceCheckUtils]: 125: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 126: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 127: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 130: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 131: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 132: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 133: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 134: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,224 INFO L273 TraceCheckUtils]: 135: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 136: Hoare triple {29207#true} assume !(~i~0 < 100); {29207#true} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 137: Hoare triple {29207#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29207#true} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 138: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:29:32,225 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29207#true} {29208#false} #72#return; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 140: Hoare triple {29208#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 141: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 142: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 143: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 144: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,225 INFO L273 TraceCheckUtils]: 145: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 146: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 147: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 148: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 149: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 150: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 151: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 152: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 153: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 154: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,226 INFO L273 TraceCheckUtils]: 155: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 156: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 157: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 158: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 159: Hoare triple {29208#false} assume !(~i~2 < 99); {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 160: Hoare triple {29208#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:29:32,227 INFO L256 TraceCheckUtils]: 161: Hoare triple {29208#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {29207#true} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 162: Hoare triple {29207#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; {29207#true} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 163: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 164: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,227 INFO L273 TraceCheckUtils]: 165: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 166: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 167: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 168: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 169: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 170: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 171: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 172: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 173: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,228 INFO L273 TraceCheckUtils]: 174: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 175: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 176: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 177: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 178: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 179: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 180: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 181: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 182: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 183: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,229 INFO L273 TraceCheckUtils]: 184: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 185: Hoare triple {29207#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 186: Hoare triple {29207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 187: Hoare triple {29207#true} assume !(~i~0 < 100); {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 188: Hoare triple {29207#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 189: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:29:32,230 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29207#true} {29208#false} #74#return; {29208#false} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 191: Hoare triple {29208#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {29208#false} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 192: Hoare triple {29208#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {29208#false} is VALID [2018-11-23 12:29:32,230 INFO L273 TraceCheckUtils]: 193: Hoare triple {29208#false} assume !false; {29208#false} is VALID [2018-11-23 12:29:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2018-11-23 12:29:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:32,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:29:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:30,081 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:30:30,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:30,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:30,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {29207#true} call ULTIMATE.init(); {29207#true} is VALID [2018-11-23 12:30:30,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {29207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29207#true} is VALID [2018-11-23 12:30:30,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:30:30,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29207#true} {29207#true} #66#return; {29207#true} is VALID [2018-11-23 12:30:30,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {29207#true} call #t~ret13 := main(); {29207#true} is VALID [2018-11-23 12:30:30,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {29207#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 33: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 34: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 37: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,631 INFO L273 TraceCheckUtils]: 38: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 39: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 40: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 41: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 43: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 45: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 49: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 50: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 51: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 53: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 54: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 55: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 56: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,633 INFO L273 TraceCheckUtils]: 58: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 60: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 61: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 62: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 63: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 64: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 65: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 71: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 72: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 73: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 74: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 75: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 76: Hoare triple {29207#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {29207#true} is VALID [2018-11-23 12:30:30,635 INFO L273 TraceCheckUtils]: 77: Hoare triple {29207#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {29207#true} is VALID [2018-11-23 12:30:30,636 INFO L273 TraceCheckUtils]: 78: Hoare triple {29207#true} assume !(~i~1 < 100); {29207#true} is VALID [2018-11-23 12:30:30,636 INFO L256 TraceCheckUtils]: 79: Hoare triple {29207#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {29207#true} is VALID [2018-11-23 12:30:30,636 INFO L273 TraceCheckUtils]: 80: Hoare triple {29207#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; {29489#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:30,638 INFO L273 TraceCheckUtils]: 81: Hoare triple {29489#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29489#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:30,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {29489#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29496#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:30,640 INFO L273 TraceCheckUtils]: 83: Hoare triple {29496#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29496#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:30,645 INFO L273 TraceCheckUtils]: 84: Hoare triple {29496#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29503#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:30,648 INFO L273 TraceCheckUtils]: 85: Hoare triple {29503#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29503#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:30,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {29503#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29510#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:30,651 INFO L273 TraceCheckUtils]: 87: Hoare triple {29510#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29510#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:30,654 INFO L273 TraceCheckUtils]: 88: Hoare triple {29510#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29517#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:30,654 INFO L273 TraceCheckUtils]: 89: Hoare triple {29517#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29517#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:30,656 INFO L273 TraceCheckUtils]: 90: Hoare triple {29517#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29524#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:30,656 INFO L273 TraceCheckUtils]: 91: Hoare triple {29524#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29524#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:30,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {29524#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29531#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:30,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {29531#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29531#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:30,661 INFO L273 TraceCheckUtils]: 94: Hoare triple {29531#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29538#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:30,661 INFO L273 TraceCheckUtils]: 95: Hoare triple {29538#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29538#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:30,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {29538#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29545#(<= xor_~i~0 9)} is VALID [2018-11-23 12:30:30,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {29545#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29545#(<= xor_~i~0 9)} is VALID [2018-11-23 12:30:30,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {29545#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29552#(<= xor_~i~0 10)} is VALID [2018-11-23 12:30:30,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {29552#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29552#(<= xor_~i~0 10)} is VALID [2018-11-23 12:30:30,667 INFO L273 TraceCheckUtils]: 100: Hoare triple {29552#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29559#(<= xor_~i~0 11)} is VALID [2018-11-23 12:30:30,667 INFO L273 TraceCheckUtils]: 101: Hoare triple {29559#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29559#(<= xor_~i~0 11)} is VALID [2018-11-23 12:30:30,667 INFO L273 TraceCheckUtils]: 102: Hoare triple {29559#(<= xor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29566#(<= xor_~i~0 12)} is VALID [2018-11-23 12:30:30,668 INFO L273 TraceCheckUtils]: 103: Hoare triple {29566#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29566#(<= xor_~i~0 12)} is VALID [2018-11-23 12:30:30,668 INFO L273 TraceCheckUtils]: 104: Hoare triple {29566#(<= xor_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= xor_~i~0 13)} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 105: Hoare triple {29573#(<= xor_~i~0 13)} assume !(~i~0 < 100); {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 106: Hoare triple {29208#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 107: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29208#false} {29207#true} #70#return; {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 109: Hoare triple {29208#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L256 TraceCheckUtils]: 110: Hoare triple {29208#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 111: Hoare triple {29208#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; {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 112: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 113: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,669 INFO L273 TraceCheckUtils]: 114: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 115: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 116: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 117: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 118: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 119: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 120: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 121: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 122: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 123: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,670 INFO L273 TraceCheckUtils]: 124: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 125: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 126: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 127: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 128: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 129: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 130: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 131: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,671 INFO L273 TraceCheckUtils]: 133: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 134: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 135: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 136: Hoare triple {29208#false} assume !(~i~0 < 100); {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 137: Hoare triple {29208#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 138: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29208#false} {29208#false} #72#return; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 140: Hoare triple {29208#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 141: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,672 INFO L273 TraceCheckUtils]: 142: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 143: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 144: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 145: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 146: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 147: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 148: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,673 INFO L273 TraceCheckUtils]: 149: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 150: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 151: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 152: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 153: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 154: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 155: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 156: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 157: Hoare triple {29208#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 158: Hoare triple {29208#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {29208#false} is VALID [2018-11-23 12:30:30,674 INFO L273 TraceCheckUtils]: 159: Hoare triple {29208#false} assume !(~i~2 < 99); {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 160: Hoare triple {29208#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L256 TraceCheckUtils]: 161: Hoare triple {29208#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 162: Hoare triple {29208#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; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 163: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 164: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 165: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 166: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 167: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,675 INFO L273 TraceCheckUtils]: 168: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 169: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 170: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 171: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 172: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 173: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 174: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 175: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 176: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 177: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,676 INFO L273 TraceCheckUtils]: 178: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 179: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 180: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 181: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 182: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 183: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 184: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 185: Hoare triple {29208#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 186: Hoare triple {29208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 187: Hoare triple {29208#false} assume !(~i~0 < 100); {29208#false} is VALID [2018-11-23 12:30:30,677 INFO L273 TraceCheckUtils]: 188: Hoare triple {29208#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29208#false} is VALID [2018-11-23 12:30:30,678 INFO L273 TraceCheckUtils]: 189: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:30:30,678 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29208#false} {29208#false} #74#return; {29208#false} is VALID [2018-11-23 12:30:30,678 INFO L273 TraceCheckUtils]: 191: Hoare triple {29208#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {29208#false} is VALID [2018-11-23 12:30:30,678 INFO L273 TraceCheckUtils]: 192: Hoare triple {29208#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {29208#false} is VALID [2018-11-23 12:30:30,678 INFO L273 TraceCheckUtils]: 193: Hoare triple {29208#false} assume !false; {29208#false} is VALID [2018-11-23 12:30:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2018-11-23 12:30:30,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:30,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2018-11-23 12:30:30,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:30:30,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:30,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:30:30,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:30,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:30:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:30:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:30:30,863 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2018-11-23 12:30:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,201 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-11-23 12:30:32,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:30:32,201 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:30:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:30:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:30:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:30:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:30:32,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 156 transitions. [2018-11-23 12:30:32,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:32,434 INFO L225 Difference]: With dead ends: 201 [2018-11-23 12:30:32,434 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:30:32,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:30:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:30:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 12:30:32,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:32,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 12:30:32,509 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 12:30:32,509 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 12:30:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,512 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:30:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:32,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 12:30:32,513 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 12:30:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,515 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:30:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:32,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:32,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:32,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:32,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:30:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-11-23 12:30:32,517 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2018-11-23 12:30:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:32,517 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-11-23 12:30:32,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:30:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:30:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:30:32,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:32,518 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 9, 9, 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:30:32,518 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:32,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 543770665, now seen corresponding path program 36 times [2018-11-23 12:30:32,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:32,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:33,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {30635#true} call ULTIMATE.init(); {30635#true} is VALID [2018-11-23 12:30:33,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {30635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30635#true} is VALID [2018-11-23 12:30:33,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:33,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30635#true} {30635#true} #66#return; {30635#true} is VALID [2018-11-23 12:30:33,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {30635#true} call #t~ret13 := main(); {30635#true} is VALID [2018-11-23 12:30:33,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {30635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30637#(= main_~i~1 0)} is VALID [2018-11-23 12:30:33,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {30637#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30637#(= main_~i~1 0)} is VALID [2018-11-23 12:30:33,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {30637#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30638#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:33,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {30638#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30638#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:33,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {30638#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30639#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:33,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {30639#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30639#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:33,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {30639#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30640#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:33,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {30640#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30640#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:33,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {30640#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30641#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:33,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {30641#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30641#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:33,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {30641#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30642#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:33,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {30642#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30642#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:33,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {30642#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30643#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:33,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {30643#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30643#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:33,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {30643#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30644#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:33,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {30644#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30644#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:33,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {30644#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30645#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:33,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {30645#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30645#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:33,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {30645#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30646#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:33,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {30646#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30646#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:33,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {30646#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30647#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:33,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {30647#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30647#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:33,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {30647#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30648#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:33,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {30648#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30648#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:33,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {30648#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30649#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:33,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {30649#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30649#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:33,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {30649#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30650#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:33,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {30650#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30650#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:33,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {30650#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30651#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:33,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {30651#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30651#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:33,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {30651#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30652#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:33,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {30652#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30652#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:33,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {30652#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30653#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:33,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {30653#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30653#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:33,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {30653#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30654#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:33,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {30654#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30654#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:33,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {30654#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30655#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:33,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {30655#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30655#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:33,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {30655#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30656#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:33,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {30656#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30656#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:33,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {30656#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30657#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:33,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {30657#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30657#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:33,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {30657#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30658#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:33,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {30658#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30658#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:33,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {30658#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30659#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:33,483 INFO L273 TraceCheckUtils]: 50: Hoare triple {30659#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30659#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:33,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {30659#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30660#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:33,484 INFO L273 TraceCheckUtils]: 52: Hoare triple {30660#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30660#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:33,485 INFO L273 TraceCheckUtils]: 53: Hoare triple {30660#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30661#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:33,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {30661#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30661#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:33,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {30661#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30662#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:33,486 INFO L273 TraceCheckUtils]: 56: Hoare triple {30662#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30662#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:33,487 INFO L273 TraceCheckUtils]: 57: Hoare triple {30662#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30663#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:33,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {30663#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30663#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:33,488 INFO L273 TraceCheckUtils]: 59: Hoare triple {30663#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30664#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:33,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {30664#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30664#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:33,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {30664#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30665#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:33,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {30665#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30665#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:33,491 INFO L273 TraceCheckUtils]: 63: Hoare triple {30665#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30666#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:33,491 INFO L273 TraceCheckUtils]: 64: Hoare triple {30666#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30666#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:33,492 INFO L273 TraceCheckUtils]: 65: Hoare triple {30666#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30667#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:33,492 INFO L273 TraceCheckUtils]: 66: Hoare triple {30667#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30667#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:33,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {30667#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30668#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:33,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {30668#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30668#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:33,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {30668#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30669#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:33,495 INFO L273 TraceCheckUtils]: 70: Hoare triple {30669#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30669#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:33,496 INFO L273 TraceCheckUtils]: 71: Hoare triple {30669#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30670#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:33,496 INFO L273 TraceCheckUtils]: 72: Hoare triple {30670#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30670#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:33,497 INFO L273 TraceCheckUtils]: 73: Hoare triple {30670#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30671#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:33,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {30671#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30671#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:33,498 INFO L273 TraceCheckUtils]: 75: Hoare triple {30671#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30672#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:33,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {30672#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30672#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:33,499 INFO L273 TraceCheckUtils]: 77: Hoare triple {30672#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30673#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:33,500 INFO L273 TraceCheckUtils]: 78: Hoare triple {30673#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30673#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:33,501 INFO L273 TraceCheckUtils]: 79: Hoare triple {30673#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30674#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:33,501 INFO L273 TraceCheckUtils]: 80: Hoare triple {30674#(<= main_~i~1 37)} assume !(~i~1 < 100); {30636#false} is VALID [2018-11-23 12:30:33,501 INFO L256 TraceCheckUtils]: 81: Hoare triple {30636#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 82: Hoare triple {30635#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; {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 83: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,503 INFO L273 TraceCheckUtils]: 88: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,503 INFO L273 TraceCheckUtils]: 89: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,503 INFO L273 TraceCheckUtils]: 90: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,503 INFO L273 TraceCheckUtils]: 91: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,503 INFO L273 TraceCheckUtils]: 92: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 93: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 94: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 95: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 96: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 97: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 98: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 99: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 100: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 101: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,504 INFO L273 TraceCheckUtils]: 102: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 103: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 104: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 105: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 106: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 107: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 108: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {30635#true} assume !(~i~0 < 100); {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 110: Hoare triple {30635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L273 TraceCheckUtils]: 111: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:33,505 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {30635#true} {30636#false} #70#return; {30636#false} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 113: Hoare triple {30636#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30636#false} is VALID [2018-11-23 12:30:33,506 INFO L256 TraceCheckUtils]: 114: Hoare triple {30636#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 115: Hoare triple {30635#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; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 116: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 117: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 118: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 119: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 120: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 121: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,506 INFO L273 TraceCheckUtils]: 122: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 123: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 124: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 125: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 126: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 127: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 128: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 129: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 130: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 131: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,507 INFO L273 TraceCheckUtils]: 132: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 133: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 134: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 135: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 136: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 137: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 138: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 139: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 140: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 141: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,508 INFO L273 TraceCheckUtils]: 142: Hoare triple {30635#true} assume !(~i~0 < 100); {30635#true} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 143: Hoare triple {30635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30635#true} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 144: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:33,509 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {30635#true} {30636#false} #72#return; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 146: Hoare triple {30636#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 147: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 148: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 149: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 150: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 151: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,509 INFO L273 TraceCheckUtils]: 152: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 153: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 154: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 155: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 156: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 157: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 158: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 159: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 160: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 161: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,510 INFO L273 TraceCheckUtils]: 162: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 163: Hoare triple {30636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30636#false} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 164: Hoare triple {30636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30636#false} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 165: Hoare triple {30636#false} assume !(~i~2 < 99); {30636#false} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 166: Hoare triple {30636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {30636#false} is VALID [2018-11-23 12:30:33,511 INFO L256 TraceCheckUtils]: 167: Hoare triple {30636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {30635#true} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 168: Hoare triple {30635#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; {30635#true} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 169: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 170: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 171: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,511 INFO L273 TraceCheckUtils]: 172: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 173: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 174: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 175: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 176: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 177: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 178: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 179: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 180: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 181: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,512 INFO L273 TraceCheckUtils]: 182: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 183: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 184: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 185: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 186: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 187: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 188: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 189: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 190: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 191: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,513 INFO L273 TraceCheckUtils]: 192: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 193: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 194: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 195: Hoare triple {30635#true} assume !(~i~0 < 100); {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 196: Hoare triple {30635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 197: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:33,514 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {30635#true} {30636#false} #74#return; {30636#false} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 199: Hoare triple {30636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30636#false} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 200: Hoare triple {30636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30636#false} is VALID [2018-11-23 12:30:33,514 INFO L273 TraceCheckUtils]: 201: Hoare triple {30636#false} assume !false; {30636#false} is VALID [2018-11-23 12:30:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2018-11-23 12:30:33,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:33,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:33,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:35,342 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-23 12:30:35,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:35,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:35,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {30635#true} call ULTIMATE.init(); {30635#true} is VALID [2018-11-23 12:30:35,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {30635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30635#true} is VALID [2018-11-23 12:30:35,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:35,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30635#true} {30635#true} #66#return; {30635#true} is VALID [2018-11-23 12:30:35,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {30635#true} call #t~ret13 := main(); {30635#true} is VALID [2018-11-23 12:30:35,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {30635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30635#true} is VALID [2018-11-23 12:30:35,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 13: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 56: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 57: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 58: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 59: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,852 INFO L273 TraceCheckUtils]: 60: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 61: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 62: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 63: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 64: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 65: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 66: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 67: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 68: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,853 INFO L273 TraceCheckUtils]: 69: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 70: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 71: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 72: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 73: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 74: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 75: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 76: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 77: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 78: Hoare triple {30635#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 79: Hoare triple {30635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30635#true} is VALID [2018-11-23 12:30:35,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {30635#true} assume !(~i~1 < 100); {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L256 TraceCheckUtils]: 81: Hoare triple {30635#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 82: Hoare triple {30635#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; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 83: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 85: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 86: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 87: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 91: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 92: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 93: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 94: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 95: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 96: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 97: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 98: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,856 INFO L273 TraceCheckUtils]: 99: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 100: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 102: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 103: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 104: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 105: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 106: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 107: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 108: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,857 INFO L273 TraceCheckUtils]: 109: Hoare triple {30635#true} assume !(~i~0 < 100); {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 110: Hoare triple {30635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 111: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {30635#true} {30635#true} #70#return; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 113: Hoare triple {30635#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L256 TraceCheckUtils]: 114: Hoare triple {30635#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 115: Hoare triple {30635#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; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 116: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 117: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 118: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,858 INFO L273 TraceCheckUtils]: 119: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 120: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 121: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 122: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 123: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 124: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 125: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 126: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 127: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 128: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,859 INFO L273 TraceCheckUtils]: 129: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 130: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 131: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 132: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 133: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 134: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 135: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 136: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 137: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 138: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,860 INFO L273 TraceCheckUtils]: 139: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L273 TraceCheckUtils]: 140: Hoare triple {30635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L273 TraceCheckUtils]: 141: Hoare triple {30635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L273 TraceCheckUtils]: 142: Hoare triple {30635#true} assume !(~i~0 < 100); {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L273 TraceCheckUtils]: 143: Hoare triple {30635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L273 TraceCheckUtils]: 144: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:30:35,861 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {30635#true} {30635#true} #72#return; {30635#true} is VALID [2018-11-23 12:30:35,862 INFO L273 TraceCheckUtils]: 146: Hoare triple {30635#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31116#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:35,862 INFO L273 TraceCheckUtils]: 147: Hoare triple {31116#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31116#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:35,862 INFO L273 TraceCheckUtils]: 148: Hoare triple {31116#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31123#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:35,863 INFO L273 TraceCheckUtils]: 149: Hoare triple {31123#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31123#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:35,863 INFO L273 TraceCheckUtils]: 150: Hoare triple {31123#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31130#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:35,863 INFO L273 TraceCheckUtils]: 151: Hoare triple {31130#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31130#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:35,864 INFO L273 TraceCheckUtils]: 152: Hoare triple {31130#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31137#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:35,864 INFO L273 TraceCheckUtils]: 153: Hoare triple {31137#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31137#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:35,865 INFO L273 TraceCheckUtils]: 154: Hoare triple {31137#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31144#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:35,865 INFO L273 TraceCheckUtils]: 155: Hoare triple {31144#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31144#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:35,865 INFO L273 TraceCheckUtils]: 156: Hoare triple {31144#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31151#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:35,866 INFO L273 TraceCheckUtils]: 157: Hoare triple {31151#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31151#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:35,866 INFO L273 TraceCheckUtils]: 158: Hoare triple {31151#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31158#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:35,867 INFO L273 TraceCheckUtils]: 159: Hoare triple {31158#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31158#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:35,867 INFO L273 TraceCheckUtils]: 160: Hoare triple {31158#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31165#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:35,868 INFO L273 TraceCheckUtils]: 161: Hoare triple {31165#(<= main_~i~2 7)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31165#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:35,869 INFO L273 TraceCheckUtils]: 162: Hoare triple {31165#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31172#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:35,869 INFO L273 TraceCheckUtils]: 163: Hoare triple {31172#(<= main_~i~2 8)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31172#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:35,870 INFO L273 TraceCheckUtils]: 164: Hoare triple {31172#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31179#(<= main_~i~2 9)} is VALID [2018-11-23 12:30:35,871 INFO L273 TraceCheckUtils]: 165: Hoare triple {31179#(<= main_~i~2 9)} assume !(~i~2 < 99); {30636#false} is VALID [2018-11-23 12:30:35,871 INFO L273 TraceCheckUtils]: 166: Hoare triple {30636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {30636#false} is VALID [2018-11-23 12:30:35,871 INFO L256 TraceCheckUtils]: 167: Hoare triple {30636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {30636#false} is VALID [2018-11-23 12:30:35,871 INFO L273 TraceCheckUtils]: 168: Hoare triple {30636#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; {30636#false} is VALID [2018-11-23 12:30:35,871 INFO L273 TraceCheckUtils]: 169: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,871 INFO L273 TraceCheckUtils]: 170: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 171: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 172: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 173: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 174: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 175: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,872 INFO L273 TraceCheckUtils]: 176: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,873 INFO L273 TraceCheckUtils]: 177: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,873 INFO L273 TraceCheckUtils]: 178: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,873 INFO L273 TraceCheckUtils]: 179: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,873 INFO L273 TraceCheckUtils]: 180: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,873 INFO L273 TraceCheckUtils]: 181: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 182: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 183: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 184: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 185: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 186: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 187: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 188: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,874 INFO L273 TraceCheckUtils]: 189: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 190: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 191: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 192: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 193: Hoare triple {30636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 194: Hoare triple {30636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 195: Hoare triple {30636#false} assume !(~i~0 < 100); {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 196: Hoare triple {30636#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 197: Hoare triple {30636#false} assume true; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {30636#false} {30636#false} #74#return; {30636#false} is VALID [2018-11-23 12:30:35,875 INFO L273 TraceCheckUtils]: 199: Hoare triple {30636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30636#false} is VALID [2018-11-23 12:30:35,876 INFO L273 TraceCheckUtils]: 200: Hoare triple {30636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30636#false} is VALID [2018-11-23 12:30:35,876 INFO L273 TraceCheckUtils]: 201: Hoare triple {30636#false} assume !false; {30636#false} is VALID [2018-11-23 12:30:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2018-11-23 12:30:35,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:35,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2018-11-23 12:30:35,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2018-11-23 12:30:35,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:35,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:30:36,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:36,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:30:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:30:36,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:30:36,050 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2018-11-23 12:30:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:36,863 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2018-11-23 12:30:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:30:36,864 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2018-11-23 12:30:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:30:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 149 transitions. [2018-11-23 12:30:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:30:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 149 transitions. [2018-11-23 12:30:36,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 149 transitions. [2018-11-23 12:30:37,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:37,011 INFO L225 Difference]: With dead ends: 207 [2018-11-23 12:30:37,011 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 12:30:37,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:30:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 12:30:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-23 12:30:37,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:37,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 145 states. [2018-11-23 12:30:37,095 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 145 states. [2018-11-23 12:30:37,095 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 145 states. [2018-11-23 12:30:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:37,097 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-23 12:30:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:30:37,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:37,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:37,098 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 147 states. [2018-11-23 12:30:37,098 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 147 states. [2018-11-23 12:30:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:37,100 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-23 12:30:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:30:37,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:37,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:37,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:37,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:30:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:30:37,102 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2018-11-23 12:30:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:37,102 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:30:37,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:30:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-23 12:30:37,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:37,103 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:37,103 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:37,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1731487351, now seen corresponding path program 37 times [2018-11-23 12:30:37,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:37,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:39,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {32108#true} call ULTIMATE.init(); {32108#true} is VALID [2018-11-23 12:30:39,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {32108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32108#true} is VALID [2018-11-23 12:30:39,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {32108#true} assume true; {32108#true} is VALID [2018-11-23 12:30:39,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32108#true} {32108#true} #66#return; {32108#true} is VALID [2018-11-23 12:30:39,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {32108#true} call #t~ret13 := main(); {32108#true} is VALID [2018-11-23 12:30:39,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {32108#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32110#(= main_~i~1 0)} is VALID [2018-11-23 12:30:39,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {32110#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32110#(= main_~i~1 0)} is VALID [2018-11-23 12:30:39,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {32110#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:39,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {32111#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:39,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {32111#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:39,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {32112#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:39,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {32112#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:39,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {32113#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:39,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {32113#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:39,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {32114#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:39,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {32114#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:39,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {32115#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:39,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {32115#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:39,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {32116#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:39,275 INFO L273 TraceCheckUtils]: 19: Hoare triple {32116#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:39,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {32117#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:39,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {32117#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:39,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {32118#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:39,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {32118#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:39,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {32119#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:39,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {32119#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:39,279 INFO L273 TraceCheckUtils]: 26: Hoare triple {32120#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:39,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {32120#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:39,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {32121#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:39,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {32121#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:39,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {32122#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:39,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {32122#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:39,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {32123#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:39,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {32123#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:39,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {32124#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:39,284 INFO L273 TraceCheckUtils]: 35: Hoare triple {32124#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:39,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {32125#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:39,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {32125#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:39,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {32126#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:39,287 INFO L273 TraceCheckUtils]: 39: Hoare triple {32126#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:39,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {32127#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:39,288 INFO L273 TraceCheckUtils]: 41: Hoare triple {32127#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:39,288 INFO L273 TraceCheckUtils]: 42: Hoare triple {32128#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:39,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {32128#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:39,290 INFO L273 TraceCheckUtils]: 44: Hoare triple {32129#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:39,290 INFO L273 TraceCheckUtils]: 45: Hoare triple {32129#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:39,291 INFO L273 TraceCheckUtils]: 46: Hoare triple {32130#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:39,292 INFO L273 TraceCheckUtils]: 47: Hoare triple {32130#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:39,292 INFO L273 TraceCheckUtils]: 48: Hoare triple {32131#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:39,293 INFO L273 TraceCheckUtils]: 49: Hoare triple {32131#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:39,293 INFO L273 TraceCheckUtils]: 50: Hoare triple {32132#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:39,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {32132#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:39,295 INFO L273 TraceCheckUtils]: 52: Hoare triple {32133#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:39,295 INFO L273 TraceCheckUtils]: 53: Hoare triple {32133#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:39,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {32134#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:39,296 INFO L273 TraceCheckUtils]: 55: Hoare triple {32134#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:39,297 INFO L273 TraceCheckUtils]: 56: Hoare triple {32135#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:39,298 INFO L273 TraceCheckUtils]: 57: Hoare triple {32135#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:39,298 INFO L273 TraceCheckUtils]: 58: Hoare triple {32136#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:39,299 INFO L273 TraceCheckUtils]: 59: Hoare triple {32136#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:39,299 INFO L273 TraceCheckUtils]: 60: Hoare triple {32137#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:39,300 INFO L273 TraceCheckUtils]: 61: Hoare triple {32137#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32138#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:39,300 INFO L273 TraceCheckUtils]: 62: Hoare triple {32138#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32138#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:39,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {32138#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32139#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:39,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {32139#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32139#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:39,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {32139#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32140#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:39,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {32140#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32140#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:39,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {32140#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32141#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:39,304 INFO L273 TraceCheckUtils]: 68: Hoare triple {32141#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32141#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:39,305 INFO L273 TraceCheckUtils]: 69: Hoare triple {32141#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32142#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:39,305 INFO L273 TraceCheckUtils]: 70: Hoare triple {32142#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32142#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:39,306 INFO L273 TraceCheckUtils]: 71: Hoare triple {32142#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32143#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:39,306 INFO L273 TraceCheckUtils]: 72: Hoare triple {32143#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32143#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:39,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {32143#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32144#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:39,307 INFO L273 TraceCheckUtils]: 74: Hoare triple {32144#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32144#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:39,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {32144#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32145#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:39,309 INFO L273 TraceCheckUtils]: 76: Hoare triple {32145#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32145#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:39,309 INFO L273 TraceCheckUtils]: 77: Hoare triple {32145#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32146#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:39,310 INFO L273 TraceCheckUtils]: 78: Hoare triple {32146#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32146#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:39,310 INFO L273 TraceCheckUtils]: 79: Hoare triple {32146#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32147#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:39,311 INFO L273 TraceCheckUtils]: 80: Hoare triple {32147#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32147#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:39,312 INFO L273 TraceCheckUtils]: 81: Hoare triple {32147#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32148#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:39,312 INFO L273 TraceCheckUtils]: 82: Hoare triple {32148#(<= main_~i~1 38)} assume !(~i~1 < 100); {32109#false} is VALID [2018-11-23 12:30:39,313 INFO L256 TraceCheckUtils]: 83: Hoare triple {32109#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {32108#true} is VALID [2018-11-23 12:30:39,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {32108#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; {32108#true} is VALID [2018-11-23 12:30:39,313 INFO L273 TraceCheckUtils]: 85: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,313 INFO L273 TraceCheckUtils]: 86: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,313 INFO L273 TraceCheckUtils]: 87: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,313 INFO L273 TraceCheckUtils]: 88: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 89: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 90: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 91: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 92: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 93: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,314 INFO L273 TraceCheckUtils]: 94: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 95: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 96: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 99: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 100: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 103: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,315 INFO L273 TraceCheckUtils]: 104: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 105: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 106: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 107: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 108: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 109: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 110: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 111: Hoare triple {32108#true} assume !(~i~0 < 100); {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 112: Hoare triple {32108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L273 TraceCheckUtils]: 113: Hoare triple {32108#true} assume true; {32108#true} is VALID [2018-11-23 12:30:39,316 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {32108#true} {32109#false} #70#return; {32109#false} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 115: Hoare triple {32109#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32109#false} is VALID [2018-11-23 12:30:39,317 INFO L256 TraceCheckUtils]: 116: Hoare triple {32109#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 117: Hoare triple {32108#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; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 118: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 119: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 120: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 121: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 122: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,317 INFO L273 TraceCheckUtils]: 123: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 124: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 125: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 126: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 127: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 128: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 129: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 130: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 131: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 132: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,318 INFO L273 TraceCheckUtils]: 133: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 134: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 135: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 136: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 137: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 138: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 139: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 140: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 141: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 142: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,319 INFO L273 TraceCheckUtils]: 143: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 144: Hoare triple {32108#true} assume !(~i~0 < 100); {32108#true} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 145: Hoare triple {32108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32108#true} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {32108#true} assume true; {32108#true} is VALID [2018-11-23 12:30:39,320 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {32108#true} {32109#false} #72#return; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 148: Hoare triple {32109#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 149: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 150: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 151: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 152: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,320 INFO L273 TraceCheckUtils]: 153: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 154: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 155: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 156: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 157: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 158: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 159: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 160: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 161: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 162: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,321 INFO L273 TraceCheckUtils]: 163: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 164: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 165: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 166: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 167: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 168: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 169: Hoare triple {32109#false} assume !(~i~2 < 99); {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 170: Hoare triple {32109#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {32109#false} is VALID [2018-11-23 12:30:39,322 INFO L256 TraceCheckUtils]: 171: Hoare triple {32109#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {32108#true} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 172: Hoare triple {32108#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; {32108#true} is VALID [2018-11-23 12:30:39,322 INFO L273 TraceCheckUtils]: 173: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 174: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 175: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 176: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 177: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 178: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 179: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 180: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 181: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 182: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,323 INFO L273 TraceCheckUtils]: 183: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 184: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 185: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 186: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 187: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 188: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 189: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 190: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 191: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 192: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,324 INFO L273 TraceCheckUtils]: 193: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 194: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 195: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 196: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 197: Hoare triple {32108#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 198: Hoare triple {32108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 199: Hoare triple {32108#true} assume !(~i~0 < 100); {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 200: Hoare triple {32108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 201: Hoare triple {32108#true} assume true; {32108#true} is VALID [2018-11-23 12:30:39,325 INFO L268 TraceCheckUtils]: 202: Hoare quadruple {32108#true} {32109#false} #74#return; {32109#false} is VALID [2018-11-23 12:30:39,325 INFO L273 TraceCheckUtils]: 203: Hoare triple {32109#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {32109#false} is VALID [2018-11-23 12:30:39,326 INFO L273 TraceCheckUtils]: 204: Hoare triple {32109#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {32109#false} is VALID [2018-11-23 12:30:39,326 INFO L273 TraceCheckUtils]: 205: Hoare triple {32109#false} assume !false; {32109#false} is VALID [2018-11-23 12:30:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:30:39,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:39,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:39,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:39,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:39,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {32108#true} call ULTIMATE.init(); {32108#true} is VALID [2018-11-23 12:30:39,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {32108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32108#true} is VALID [2018-11-23 12:30:39,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {32108#true} assume true; {32108#true} is VALID [2018-11-23 12:30:39,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32108#true} {32108#true} #66#return; {32108#true} is VALID [2018-11-23 12:30:39,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {32108#true} call #t~ret13 := main(); {32108#true} is VALID [2018-11-23 12:30:39,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {32108#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32167#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:39,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {32167#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32167#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:39,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {32167#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:39,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {32111#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:39,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {32111#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:39,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {32112#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:39,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {32112#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:39,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {32113#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:39,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {32113#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:39,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {32114#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:39,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {32114#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:39,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {32115#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:39,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {32115#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:39,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {32116#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:39,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {32116#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:39,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {32117#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:39,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {32117#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:39,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {32118#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:39,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {32118#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:39,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {32119#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:39,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {32119#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:39,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {32120#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:39,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {32120#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:39,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {32121#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:39,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {32121#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:39,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {32122#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:39,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {32122#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:39,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {32123#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:39,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {32123#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:39,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {32124#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:39,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {32124#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:39,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {32125#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:39,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {32125#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:39,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {32126#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:39,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {32126#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:39,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {32127#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:39,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {32127#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:39,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {32128#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:39,873 INFO L273 TraceCheckUtils]: 43: Hoare triple {32128#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:39,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {32129#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:39,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {32129#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:39,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {32130#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:39,875 INFO L273 TraceCheckUtils]: 47: Hoare triple {32130#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:39,876 INFO L273 TraceCheckUtils]: 48: Hoare triple {32131#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:39,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {32131#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:39,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {32132#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:39,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {32132#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:39,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {32133#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:39,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {32133#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:39,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {32134#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:39,880 INFO L273 TraceCheckUtils]: 55: Hoare triple {32134#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:39,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {32135#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:39,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {32135#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:39,882 INFO L273 TraceCheckUtils]: 58: Hoare triple {32136#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:39,883 INFO L273 TraceCheckUtils]: 59: Hoare triple {32136#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:39,883 INFO L273 TraceCheckUtils]: 60: Hoare triple {32137#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:39,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {32137#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32138#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:39,884 INFO L273 TraceCheckUtils]: 62: Hoare triple {32138#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32138#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:39,885 INFO L273 TraceCheckUtils]: 63: Hoare triple {32138#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32139#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:39,886 INFO L273 TraceCheckUtils]: 64: Hoare triple {32139#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32139#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:39,886 INFO L273 TraceCheckUtils]: 65: Hoare triple {32139#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32140#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:39,887 INFO L273 TraceCheckUtils]: 66: Hoare triple {32140#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32140#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:39,888 INFO L273 TraceCheckUtils]: 67: Hoare triple {32140#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32141#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:39,888 INFO L273 TraceCheckUtils]: 68: Hoare triple {32141#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32141#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:39,889 INFO L273 TraceCheckUtils]: 69: Hoare triple {32141#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32142#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:39,889 INFO L273 TraceCheckUtils]: 70: Hoare triple {32142#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32142#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:39,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {32142#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32143#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:39,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {32143#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32143#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:39,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {32143#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32144#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:39,892 INFO L273 TraceCheckUtils]: 74: Hoare triple {32144#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32144#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:39,892 INFO L273 TraceCheckUtils]: 75: Hoare triple {32144#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32145#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:39,893 INFO L273 TraceCheckUtils]: 76: Hoare triple {32145#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32145#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:39,894 INFO L273 TraceCheckUtils]: 77: Hoare triple {32145#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32146#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:39,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {32146#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32146#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:39,895 INFO L273 TraceCheckUtils]: 79: Hoare triple {32146#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32147#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:39,895 INFO L273 TraceCheckUtils]: 80: Hoare triple {32147#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {32147#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:39,896 INFO L273 TraceCheckUtils]: 81: Hoare triple {32147#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {32148#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:39,897 INFO L273 TraceCheckUtils]: 82: Hoare triple {32148#(<= main_~i~1 38)} assume !(~i~1 < 100); {32109#false} is VALID [2018-11-23 12:30:39,897 INFO L256 TraceCheckUtils]: 83: Hoare triple {32109#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {32109#false} is VALID [2018-11-23 12:30:39,897 INFO L273 TraceCheckUtils]: 84: Hoare triple {32109#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; {32109#false} is VALID [2018-11-23 12:30:39,897 INFO L273 TraceCheckUtils]: 85: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 86: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 87: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 88: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 89: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 90: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,898 INFO L273 TraceCheckUtils]: 91: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 92: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 93: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 94: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 95: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 96: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,899 INFO L273 TraceCheckUtils]: 97: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 98: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 99: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 100: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 101: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 102: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,900 INFO L273 TraceCheckUtils]: 103: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 104: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 105: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 106: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 107: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 108: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 109: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 110: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 111: Hoare triple {32109#false} assume !(~i~0 < 100); {32109#false} is VALID [2018-11-23 12:30:39,901 INFO L273 TraceCheckUtils]: 112: Hoare triple {32109#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 113: Hoare triple {32109#false} assume true; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {32109#false} {32109#false} #70#return; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 115: Hoare triple {32109#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L256 TraceCheckUtils]: 116: Hoare triple {32109#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 117: Hoare triple {32109#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; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 119: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 120: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 121: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,902 INFO L273 TraceCheckUtils]: 122: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 123: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 124: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 125: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 126: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 127: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 128: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 129: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 130: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 131: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,903 INFO L273 TraceCheckUtils]: 132: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 133: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 134: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 135: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 136: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 137: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 138: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 139: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 140: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 141: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,904 INFO L273 TraceCheckUtils]: 142: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 143: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 144: Hoare triple {32109#false} assume !(~i~0 < 100); {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 145: Hoare triple {32109#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 146: Hoare triple {32109#false} assume true; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {32109#false} {32109#false} #72#return; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 148: Hoare triple {32109#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 149: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 150: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 151: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,905 INFO L273 TraceCheckUtils]: 152: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 153: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 154: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 155: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 156: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 157: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 158: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 159: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 160: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 161: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,906 INFO L273 TraceCheckUtils]: 162: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 163: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 164: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 165: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 166: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 167: Hoare triple {32109#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 168: Hoare triple {32109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 169: Hoare triple {32109#false} assume !(~i~2 < 99); {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 170: Hoare triple {32109#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L256 TraceCheckUtils]: 171: Hoare triple {32109#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {32109#false} is VALID [2018-11-23 12:30:39,907 INFO L273 TraceCheckUtils]: 172: Hoare triple {32109#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; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 173: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 174: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 175: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 176: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 177: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 178: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 179: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 180: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 181: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,908 INFO L273 TraceCheckUtils]: 182: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 183: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 184: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 185: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 186: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 187: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 188: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 189: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 190: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 191: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,909 INFO L273 TraceCheckUtils]: 192: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 193: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 194: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 195: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 196: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 197: Hoare triple {32109#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 198: Hoare triple {32109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 199: Hoare triple {32109#false} assume !(~i~0 < 100); {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 200: Hoare triple {32109#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L273 TraceCheckUtils]: 201: Hoare triple {32109#false} assume true; {32109#false} is VALID [2018-11-23 12:30:39,910 INFO L268 TraceCheckUtils]: 202: Hoare quadruple {32109#false} {32109#false} #74#return; {32109#false} is VALID [2018-11-23 12:30:39,911 INFO L273 TraceCheckUtils]: 203: Hoare triple {32109#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {32109#false} is VALID [2018-11-23 12:30:39,911 INFO L273 TraceCheckUtils]: 204: Hoare triple {32109#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {32109#false} is VALID [2018-11-23 12:30:39,911 INFO L273 TraceCheckUtils]: 205: Hoare triple {32109#false} assume !false; {32109#false} is VALID [2018-11-23 12:30:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:30:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:30:39,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2018-11-23 12:30:39,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:39,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:30:40,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:40,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:30:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:30:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:40,064 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:30:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:40,750 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:30:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:30:40,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2018-11-23 12:30:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:40,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:30:40,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:40,888 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:30:40,888 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:30:40,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:30:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:30:40,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:40,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:40,956 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:40,956 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:40,959 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:40,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:40,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:40,960 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:40,960 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:40,962 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:40,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:40,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:40,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:40,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:30:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:30:40,964 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2018-11-23 12:30:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:30:40,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:30:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:30:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-23 12:30:40,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:40,965 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:40,966 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:40,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1569768853, now seen corresponding path program 38 times [2018-11-23 12:30:40,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:40,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:40,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:41,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {33595#true} call ULTIMATE.init(); {33595#true} is VALID [2018-11-23 12:30:41,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {33595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33595#true} is VALID [2018-11-23 12:30:41,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {33595#true} assume true; {33595#true} is VALID [2018-11-23 12:30:41,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33595#true} {33595#true} #66#return; {33595#true} is VALID [2018-11-23 12:30:41,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {33595#true} call #t~ret13 := main(); {33595#true} is VALID [2018-11-23 12:30:41,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {33595#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33597#(= main_~i~1 0)} is VALID [2018-11-23 12:30:41,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {33597#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33597#(= main_~i~1 0)} is VALID [2018-11-23 12:30:41,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {33597#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33598#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:41,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {33598#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33598#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:41,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {33598#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33599#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:41,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {33599#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33599#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:41,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {33599#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33600#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:41,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {33600#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33600#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:41,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {33600#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33601#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:41,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {33601#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33601#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:41,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {33601#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33602#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:41,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {33602#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33602#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:41,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {33602#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33603#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:41,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {33603#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33603#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:41,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {33603#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33604#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:41,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {33604#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33604#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:41,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {33604#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33605#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:41,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {33605#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33605#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:41,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {33605#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33606#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:41,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {33606#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33606#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:41,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {33606#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33607#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:41,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {33607#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33607#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:41,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {33607#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33608#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:41,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {33608#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33608#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:41,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {33608#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33609#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:41,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {33609#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33609#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:41,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {33609#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33610#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:41,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {33610#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33610#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:41,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {33610#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33611#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:41,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {33611#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33611#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:41,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {33611#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33612#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:41,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {33612#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33612#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:41,980 INFO L273 TraceCheckUtils]: 37: Hoare triple {33612#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33613#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:41,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {33613#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33613#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:41,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {33613#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33614#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:41,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {33614#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33614#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:41,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {33614#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33615#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:41,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {33615#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33615#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:41,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {33615#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33616#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:41,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {33616#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33616#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:41,985 INFO L273 TraceCheckUtils]: 45: Hoare triple {33616#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33617#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:41,985 INFO L273 TraceCheckUtils]: 46: Hoare triple {33617#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33617#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:41,986 INFO L273 TraceCheckUtils]: 47: Hoare triple {33617#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33618#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:41,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {33618#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33618#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:41,987 INFO L273 TraceCheckUtils]: 49: Hoare triple {33618#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33619#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:41,988 INFO L273 TraceCheckUtils]: 50: Hoare triple {33619#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33619#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:41,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {33619#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33620#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:41,989 INFO L273 TraceCheckUtils]: 52: Hoare triple {33620#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33620#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:41,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {33620#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33621#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:41,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {33621#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33621#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:41,991 INFO L273 TraceCheckUtils]: 55: Hoare triple {33621#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33622#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:41,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {33622#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33622#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:41,992 INFO L273 TraceCheckUtils]: 57: Hoare triple {33622#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33623#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:41,993 INFO L273 TraceCheckUtils]: 58: Hoare triple {33623#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33623#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:41,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {33623#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33624#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:41,994 INFO L273 TraceCheckUtils]: 60: Hoare triple {33624#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33624#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:41,995 INFO L273 TraceCheckUtils]: 61: Hoare triple {33624#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33625#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:41,995 INFO L273 TraceCheckUtils]: 62: Hoare triple {33625#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33625#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:41,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {33625#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33626#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:41,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {33626#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33626#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:41,997 INFO L273 TraceCheckUtils]: 65: Hoare triple {33626#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33627#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:41,998 INFO L273 TraceCheckUtils]: 66: Hoare triple {33627#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33627#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:41,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {33627#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33628#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:41,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {33628#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33628#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:42,000 INFO L273 TraceCheckUtils]: 69: Hoare triple {33628#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33629#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:42,000 INFO L273 TraceCheckUtils]: 70: Hoare triple {33629#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33629#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:42,001 INFO L273 TraceCheckUtils]: 71: Hoare triple {33629#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33630#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:42,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {33630#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33630#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:42,002 INFO L273 TraceCheckUtils]: 73: Hoare triple {33630#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33631#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:42,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {33631#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33631#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:42,003 INFO L273 TraceCheckUtils]: 75: Hoare triple {33631#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33632#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:42,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {33632#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33632#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:42,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {33632#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33633#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:42,005 INFO L273 TraceCheckUtils]: 78: Hoare triple {33633#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33633#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:42,006 INFO L273 TraceCheckUtils]: 79: Hoare triple {33633#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33634#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:42,006 INFO L273 TraceCheckUtils]: 80: Hoare triple {33634#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33634#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:42,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {33634#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33635#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:42,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {33635#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33635#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:42,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {33635#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33636#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:42,009 INFO L273 TraceCheckUtils]: 84: Hoare triple {33636#(<= main_~i~1 39)} assume !(~i~1 < 100); {33596#false} is VALID [2018-11-23 12:30:42,009 INFO L256 TraceCheckUtils]: 85: Hoare triple {33596#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {33595#true} is VALID [2018-11-23 12:30:42,009 INFO L273 TraceCheckUtils]: 86: Hoare triple {33595#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; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 87: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 88: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 89: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 90: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 91: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,010 INFO L273 TraceCheckUtils]: 92: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 93: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 94: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 95: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 96: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 97: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,011 INFO L273 TraceCheckUtils]: 98: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,012 INFO L273 TraceCheckUtils]: 99: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,012 INFO L273 TraceCheckUtils]: 100: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,012 INFO L273 TraceCheckUtils]: 101: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,012 INFO L273 TraceCheckUtils]: 102: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,012 INFO L273 TraceCheckUtils]: 103: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 104: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 105: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 106: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 107: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 108: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,013 INFO L273 TraceCheckUtils]: 109: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 110: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 111: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 112: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 113: Hoare triple {33595#true} assume !(~i~0 < 100); {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 114: Hoare triple {33595#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 115: Hoare triple {33595#true} assume true; {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {33595#true} {33596#false} #70#return; {33596#false} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 117: Hoare triple {33596#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33596#false} is VALID [2018-11-23 12:30:42,014 INFO L256 TraceCheckUtils]: 118: Hoare triple {33596#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {33595#true} is VALID [2018-11-23 12:30:42,014 INFO L273 TraceCheckUtils]: 119: Hoare triple {33595#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; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 120: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 121: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 122: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 123: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 124: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 125: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 126: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 127: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 128: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,015 INFO L273 TraceCheckUtils]: 129: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 130: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 131: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 132: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 133: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 134: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 135: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 136: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 137: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,016 INFO L273 TraceCheckUtils]: 138: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 139: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 140: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 141: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 142: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 143: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 144: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 145: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 146: Hoare triple {33595#true} assume !(~i~0 < 100); {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 147: Hoare triple {33595#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33595#true} is VALID [2018-11-23 12:30:42,017 INFO L273 TraceCheckUtils]: 148: Hoare triple {33595#true} assume true; {33595#true} is VALID [2018-11-23 12:30:42,018 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {33595#true} {33596#false} #72#return; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 150: Hoare triple {33596#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 151: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 152: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 153: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 154: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 155: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 156: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 157: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,018 INFO L273 TraceCheckUtils]: 158: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 159: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 160: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 161: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 162: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 163: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 164: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 165: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 166: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,019 INFO L273 TraceCheckUtils]: 167: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 168: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 169: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 170: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 171: Hoare triple {33596#false} assume !(~i~2 < 99); {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 172: Hoare triple {33596#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {33596#false} is VALID [2018-11-23 12:30:42,020 INFO L256 TraceCheckUtils]: 173: Hoare triple {33596#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {33595#true} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 174: Hoare triple {33595#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; {33595#true} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 175: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 176: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,020 INFO L273 TraceCheckUtils]: 177: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 178: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 179: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 180: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 181: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 182: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 183: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 184: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 185: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 186: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,021 INFO L273 TraceCheckUtils]: 187: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 188: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 189: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 190: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 191: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 192: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 193: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 194: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 195: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 196: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,022 INFO L273 TraceCheckUtils]: 197: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 198: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 199: Hoare triple {33595#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 200: Hoare triple {33595#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 201: Hoare triple {33595#true} assume !(~i~0 < 100); {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 202: Hoare triple {33595#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 203: Hoare triple {33595#true} assume true; {33595#true} is VALID [2018-11-23 12:30:42,023 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {33595#true} {33596#false} #74#return; {33596#false} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 205: Hoare triple {33596#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33596#false} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 206: Hoare triple {33596#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33596#false} is VALID [2018-11-23 12:30:42,023 INFO L273 TraceCheckUtils]: 207: Hoare triple {33596#false} assume !false; {33596#false} is VALID [2018-11-23 12:30:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:30:42,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:42,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:42,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:42,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:42,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:43,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {33595#true} call ULTIMATE.init(); {33595#true} is VALID [2018-11-23 12:30:43,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {33595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33595#true} is VALID [2018-11-23 12:30:43,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {33595#true} assume true; {33595#true} is VALID [2018-11-23 12:30:43,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33595#true} {33595#true} #66#return; {33595#true} is VALID [2018-11-23 12:30:43,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {33595#true} call #t~ret13 := main(); {33595#true} is VALID [2018-11-23 12:30:43,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {33595#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33655#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:43,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {33655#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33655#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:43,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {33655#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33598#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:43,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {33598#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33598#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:43,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {33598#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33599#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:43,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {33599#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33599#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:43,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {33599#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33600#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:43,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {33600#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33600#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:43,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {33600#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33601#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:43,319 INFO L273 TraceCheckUtils]: 14: Hoare triple {33601#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33601#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:43,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {33601#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33602#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:43,320 INFO L273 TraceCheckUtils]: 16: Hoare triple {33602#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33602#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:43,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {33602#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33603#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:43,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {33603#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33603#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:43,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {33603#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33604#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:43,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {33604#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33604#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:43,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {33604#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33605#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:43,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {33605#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33605#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:43,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {33605#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33606#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:43,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {33606#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33606#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:43,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {33606#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33607#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:43,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {33607#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33607#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:43,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {33607#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33608#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:43,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {33608#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33608#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:43,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {33608#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33609#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:43,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {33609#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33609#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:43,330 INFO L273 TraceCheckUtils]: 31: Hoare triple {33609#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33610#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:43,330 INFO L273 TraceCheckUtils]: 32: Hoare triple {33610#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33610#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:43,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {33610#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33611#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:43,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {33611#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33611#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:43,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {33611#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33612#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:43,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {33612#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33612#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:43,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {33612#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33613#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:43,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {33613#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33613#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:43,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {33613#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33614#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:43,335 INFO L273 TraceCheckUtils]: 40: Hoare triple {33614#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33614#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:43,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {33614#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33615#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:43,336 INFO L273 TraceCheckUtils]: 42: Hoare triple {33615#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33615#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:43,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {33615#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33616#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:43,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {33616#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33616#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:43,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {33616#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33617#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:43,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {33617#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33617#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:43,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {33617#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33618#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:43,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {33618#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33618#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:43,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {33618#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33619#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:43,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {33619#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33619#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:43,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {33619#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33620#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:43,343 INFO L273 TraceCheckUtils]: 52: Hoare triple {33620#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33620#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:43,343 INFO L273 TraceCheckUtils]: 53: Hoare triple {33620#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33621#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:43,344 INFO L273 TraceCheckUtils]: 54: Hoare triple {33621#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33621#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:43,345 INFO L273 TraceCheckUtils]: 55: Hoare triple {33621#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33622#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:43,345 INFO L273 TraceCheckUtils]: 56: Hoare triple {33622#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33622#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:43,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {33622#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33623#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:43,346 INFO L273 TraceCheckUtils]: 58: Hoare triple {33623#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33623#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:43,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {33623#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33624#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:43,347 INFO L273 TraceCheckUtils]: 60: Hoare triple {33624#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33624#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:43,348 INFO L273 TraceCheckUtils]: 61: Hoare triple {33624#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33625#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:43,349 INFO L273 TraceCheckUtils]: 62: Hoare triple {33625#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33625#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:43,349 INFO L273 TraceCheckUtils]: 63: Hoare triple {33625#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33626#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:43,350 INFO L273 TraceCheckUtils]: 64: Hoare triple {33626#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33626#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:43,350 INFO L273 TraceCheckUtils]: 65: Hoare triple {33626#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33627#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:43,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {33627#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33627#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:43,352 INFO L273 TraceCheckUtils]: 67: Hoare triple {33627#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33628#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:43,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {33628#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33628#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:43,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {33628#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33629#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:43,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {33629#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33629#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:43,354 INFO L273 TraceCheckUtils]: 71: Hoare triple {33629#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33630#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:43,355 INFO L273 TraceCheckUtils]: 72: Hoare triple {33630#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33630#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:43,355 INFO L273 TraceCheckUtils]: 73: Hoare triple {33630#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33631#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:43,356 INFO L273 TraceCheckUtils]: 74: Hoare triple {33631#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33631#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:43,356 INFO L273 TraceCheckUtils]: 75: Hoare triple {33631#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33632#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:43,357 INFO L273 TraceCheckUtils]: 76: Hoare triple {33632#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33632#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:43,358 INFO L273 TraceCheckUtils]: 77: Hoare triple {33632#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33633#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:43,358 INFO L273 TraceCheckUtils]: 78: Hoare triple {33633#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33633#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:43,359 INFO L273 TraceCheckUtils]: 79: Hoare triple {33633#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33634#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:43,359 INFO L273 TraceCheckUtils]: 80: Hoare triple {33634#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33634#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:43,360 INFO L273 TraceCheckUtils]: 81: Hoare triple {33634#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33635#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:43,360 INFO L273 TraceCheckUtils]: 82: Hoare triple {33635#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33635#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:43,361 INFO L273 TraceCheckUtils]: 83: Hoare triple {33635#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33636#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:43,362 INFO L273 TraceCheckUtils]: 84: Hoare triple {33636#(<= main_~i~1 39)} assume !(~i~1 < 100); {33596#false} is VALID [2018-11-23 12:30:43,362 INFO L256 TraceCheckUtils]: 85: Hoare triple {33596#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {33596#false} is VALID [2018-11-23 12:30:43,362 INFO L273 TraceCheckUtils]: 86: Hoare triple {33596#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; {33596#false} is VALID [2018-11-23 12:30:43,362 INFO L273 TraceCheckUtils]: 87: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,362 INFO L273 TraceCheckUtils]: 88: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 89: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 90: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 91: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 92: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 93: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,363 INFO L273 TraceCheckUtils]: 94: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 95: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 96: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 97: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 98: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 99: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 100: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,364 INFO L273 TraceCheckUtils]: 101: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 102: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 103: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 104: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 105: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 106: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 107: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 108: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 109: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 110: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,365 INFO L273 TraceCheckUtils]: 111: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 112: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 113: Hoare triple {33596#false} assume !(~i~0 < 100); {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 114: Hoare triple {33596#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 115: Hoare triple {33596#false} assume true; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {33596#false} {33596#false} #70#return; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 117: Hoare triple {33596#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L256 TraceCheckUtils]: 118: Hoare triple {33596#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 119: Hoare triple {33596#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; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 120: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,366 INFO L273 TraceCheckUtils]: 121: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 122: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 123: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 124: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 125: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 126: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 127: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 128: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 129: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,367 INFO L273 TraceCheckUtils]: 130: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 131: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 132: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 133: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 134: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 135: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 136: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 137: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 138: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 139: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,368 INFO L273 TraceCheckUtils]: 140: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 141: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 142: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 143: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 144: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 145: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 146: Hoare triple {33596#false} assume !(~i~0 < 100); {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 147: Hoare triple {33596#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 148: Hoare triple {33596#false} assume true; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {33596#false} {33596#false} #72#return; {33596#false} is VALID [2018-11-23 12:30:43,369 INFO L273 TraceCheckUtils]: 150: Hoare triple {33596#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 151: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 152: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 153: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 154: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 155: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 156: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 157: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 158: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 159: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,370 INFO L273 TraceCheckUtils]: 160: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 161: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 162: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 163: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 164: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 165: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 166: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 167: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 168: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 169: Hoare triple {33596#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33596#false} is VALID [2018-11-23 12:30:43,371 INFO L273 TraceCheckUtils]: 170: Hoare triple {33596#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 171: Hoare triple {33596#false} assume !(~i~2 < 99); {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 172: Hoare triple {33596#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L256 TraceCheckUtils]: 173: Hoare triple {33596#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 174: Hoare triple {33596#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; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 175: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 176: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 177: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 178: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 179: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,372 INFO L273 TraceCheckUtils]: 180: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 181: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 182: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 183: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 184: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 185: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 186: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 187: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 188: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 189: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,373 INFO L273 TraceCheckUtils]: 190: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 191: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 192: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 193: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 194: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 195: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 196: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 197: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 198: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,374 INFO L273 TraceCheckUtils]: 199: Hoare triple {33596#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 200: Hoare triple {33596#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 201: Hoare triple {33596#false} assume !(~i~0 < 100); {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 202: Hoare triple {33596#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 203: Hoare triple {33596#false} assume true; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {33596#false} {33596#false} #74#return; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 205: Hoare triple {33596#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 206: Hoare triple {33596#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33596#false} is VALID [2018-11-23 12:30:43,375 INFO L273 TraceCheckUtils]: 207: Hoare triple {33596#false} assume !false; {33596#false} is VALID [2018-11-23 12:30:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:30:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:30:43,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2018-11-23 12:30:43,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:43,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:30:43,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:43,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:30:43,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:30:43,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:43,528 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2018-11-23 12:30:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:44,562 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2018-11-23 12:30:44,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:30:44,562 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2018-11-23 12:30:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 132 transitions. [2018-11-23 12:30:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 132 transitions. [2018-11-23 12:30:44,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 132 transitions. [2018-11-23 12:30:44,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:44,736 INFO L225 Difference]: With dead ends: 212 [2018-11-23 12:30:44,736 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:30:44,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:30:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-23 12:30:44,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:44,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-23 12:30:44,831 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-23 12:30:44,831 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-23 12:30:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:44,834 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-23 12:30:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-23 12:30:44,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:44,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:44,834 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-23 12:30:44,835 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-23 12:30:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:44,836 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-23 12:30:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-23 12:30:44,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:44,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:44,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:44,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 12:30:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-23 12:30:44,839 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2018-11-23 12:30:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:44,839 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-23 12:30:44,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:30:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-23 12:30:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-23 12:30:44,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:44,840 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:44,840 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:44,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -777114931, now seen corresponding path program 39 times [2018-11-23 12:30:44,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:44,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:44,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:46,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {35099#true} call ULTIMATE.init(); {35099#true} is VALID [2018-11-23 12:30:46,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {35099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35099#true} is VALID [2018-11-23 12:30:46,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {35099#true} assume true; {35099#true} is VALID [2018-11-23 12:30:46,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35099#true} {35099#true} #66#return; {35099#true} is VALID [2018-11-23 12:30:46,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {35099#true} call #t~ret13 := main(); {35099#true} is VALID [2018-11-23 12:30:46,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {35099#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35101#(= main_~i~1 0)} is VALID [2018-11-23 12:30:46,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {35101#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35101#(= main_~i~1 0)} is VALID [2018-11-23 12:30:46,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {35101#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35102#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:46,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {35102#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35102#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:46,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {35102#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35103#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:46,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {35103#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35103#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:46,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {35103#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35104#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:46,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {35104#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35104#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:46,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {35104#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35105#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:46,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {35105#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35105#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:46,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {35105#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35106#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:46,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {35106#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35106#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:46,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {35106#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35107#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:46,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {35107#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35107#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:46,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {35107#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35108#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:46,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {35108#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35108#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:46,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {35108#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35109#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:46,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {35109#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35109#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:46,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {35109#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35110#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:46,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {35110#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35110#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:46,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {35110#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35111#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:46,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {35111#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35111#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:46,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {35111#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35112#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:46,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {35112#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35112#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:46,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {35112#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35113#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:46,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {35113#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35113#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:46,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {35113#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35114#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:46,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {35114#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35114#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:46,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {35114#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35115#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:46,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {35115#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35115#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:46,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {35115#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35116#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:46,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {35116#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35116#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:46,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {35116#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35117#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:46,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {35117#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35117#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:46,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {35117#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35118#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:46,439 INFO L273 TraceCheckUtils]: 40: Hoare triple {35118#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35118#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:46,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {35118#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35119#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:46,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {35119#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35119#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:46,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {35119#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35120#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:46,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {35120#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35120#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:46,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {35120#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35121#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:46,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {35121#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35121#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:46,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {35121#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35122#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:46,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {35122#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35122#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:46,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {35122#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35123#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:46,445 INFO L273 TraceCheckUtils]: 50: Hoare triple {35123#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35123#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:46,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {35123#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35124#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:46,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {35124#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35124#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:46,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {35124#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35125#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:46,447 INFO L273 TraceCheckUtils]: 54: Hoare triple {35125#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35125#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:46,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {35125#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35126#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:46,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {35126#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35126#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:46,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {35126#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35127#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:46,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {35127#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35127#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:46,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {35127#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35128#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:46,451 INFO L273 TraceCheckUtils]: 60: Hoare triple {35128#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35128#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:46,451 INFO L273 TraceCheckUtils]: 61: Hoare triple {35128#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35129#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:46,452 INFO L273 TraceCheckUtils]: 62: Hoare triple {35129#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35129#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:46,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {35129#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35130#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:46,453 INFO L273 TraceCheckUtils]: 64: Hoare triple {35130#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35130#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:46,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {35130#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35131#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:46,454 INFO L273 TraceCheckUtils]: 66: Hoare triple {35131#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35131#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:46,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {35131#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35132#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:46,455 INFO L273 TraceCheckUtils]: 68: Hoare triple {35132#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35132#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:46,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {35132#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35133#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:46,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {35133#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35133#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:46,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {35133#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35134#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:46,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {35134#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35134#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:46,458 INFO L273 TraceCheckUtils]: 73: Hoare triple {35134#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35135#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:46,459 INFO L273 TraceCheckUtils]: 74: Hoare triple {35135#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35135#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:46,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {35135#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35136#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:46,460 INFO L273 TraceCheckUtils]: 76: Hoare triple {35136#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35136#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:46,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {35136#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35137#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:46,461 INFO L273 TraceCheckUtils]: 78: Hoare triple {35137#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35137#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:46,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {35137#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35138#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:46,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {35138#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35138#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:46,463 INFO L273 TraceCheckUtils]: 81: Hoare triple {35138#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35139#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:46,463 INFO L273 TraceCheckUtils]: 82: Hoare triple {35139#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35139#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:46,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {35139#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35140#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:46,465 INFO L273 TraceCheckUtils]: 84: Hoare triple {35140#(<= main_~i~1 39)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {35140#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:46,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {35140#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {35141#(<= main_~i~1 40)} is VALID [2018-11-23 12:30:46,466 INFO L273 TraceCheckUtils]: 86: Hoare triple {35141#(<= main_~i~1 40)} assume !(~i~1 < 100); {35100#false} is VALID [2018-11-23 12:30:46,466 INFO L256 TraceCheckUtils]: 87: Hoare triple {35100#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {35099#true} is VALID [2018-11-23 12:30:46,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {35099#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; {35099#true} is VALID [2018-11-23 12:30:46,466 INFO L273 TraceCheckUtils]: 89: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 90: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 91: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 92: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 93: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 94: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,467 INFO L273 TraceCheckUtils]: 95: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 96: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 97: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 98: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 99: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 100: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,468 INFO L273 TraceCheckUtils]: 101: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 102: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 103: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 104: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 105: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 106: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,469 INFO L273 TraceCheckUtils]: 107: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 108: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 109: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 110: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 111: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 112: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 113: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 114: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,470 INFO L273 TraceCheckUtils]: 115: Hoare triple {35099#true} assume !(~i~0 < 100); {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 116: Hoare triple {35099#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 117: Hoare triple {35099#true} assume true; {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {35099#true} {35100#false} #70#return; {35100#false} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 119: Hoare triple {35100#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35100#false} is VALID [2018-11-23 12:30:46,471 INFO L256 TraceCheckUtils]: 120: Hoare triple {35100#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#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; {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 123: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 124: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,471 INFO L273 TraceCheckUtils]: 125: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 126: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 127: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 128: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 129: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 130: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 131: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 132: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 133: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 134: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,472 INFO L273 TraceCheckUtils]: 135: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 136: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 137: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 138: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 139: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 140: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 141: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 142: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 143: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 144: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,473 INFO L273 TraceCheckUtils]: 145: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 146: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 147: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 148: Hoare triple {35099#true} assume !(~i~0 < 100); {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 149: Hoare triple {35099#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 150: Hoare triple {35099#true} assume true; {35099#true} is VALID [2018-11-23 12:30:46,474 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {35099#true} {35100#false} #72#return; {35100#false} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 152: Hoare triple {35100#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {35100#false} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 153: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 154: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,474 INFO L273 TraceCheckUtils]: 155: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 156: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 157: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 158: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 159: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 160: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 161: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 162: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 163: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 164: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,475 INFO L273 TraceCheckUtils]: 165: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 166: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 167: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 168: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 169: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 170: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 171: Hoare triple {35100#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 172: Hoare triple {35100#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 173: Hoare triple {35100#false} assume !(~i~2 < 99); {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L273 TraceCheckUtils]: 174: Hoare triple {35100#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {35100#false} is VALID [2018-11-23 12:30:46,476 INFO L256 TraceCheckUtils]: 175: Hoare triple {35100#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 176: Hoare triple {35099#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; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 177: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 178: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 179: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 180: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 181: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 182: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 183: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 184: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,477 INFO L273 TraceCheckUtils]: 185: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 186: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 187: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 188: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 189: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 190: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 191: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 192: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 193: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 194: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,478 INFO L273 TraceCheckUtils]: 195: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 196: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 197: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 198: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 199: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 200: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 201: Hoare triple {35099#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 202: Hoare triple {35099#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 203: Hoare triple {35099#true} assume !(~i~0 < 100); {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 204: Hoare triple {35099#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35099#true} is VALID [2018-11-23 12:30:46,479 INFO L273 TraceCheckUtils]: 205: Hoare triple {35099#true} assume true; {35099#true} is VALID [2018-11-23 12:30:46,480 INFO L268 TraceCheckUtils]: 206: Hoare quadruple {35099#true} {35100#false} #74#return; {35100#false} is VALID [2018-11-23 12:30:46,480 INFO L273 TraceCheckUtils]: 207: Hoare triple {35100#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {35100#false} is VALID [2018-11-23 12:30:46,480 INFO L273 TraceCheckUtils]: 208: Hoare triple {35100#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35100#false} is VALID [2018-11-23 12:30:46,480 INFO L273 TraceCheckUtils]: 209: Hoare triple {35100#false} assume !false; {35100#false} is VALID [2018-11-23 12:30:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-11-23 12:30:46,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:46,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:46,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2