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/xor3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:28:34,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:28:34,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:28:34,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:28:34,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:28:34,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:28:34,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:28:34,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:28:34,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:28:34,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:28:34,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:28:34,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:28:34,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:28:34,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:28:34,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:28:34,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:28:34,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:28:34,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:28:34,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:28:34,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:28:34,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:28:34,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:28:34,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:28:34,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:28:34,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:28:34,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:28:34,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:28:34,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:28:34,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:28:34,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:28:34,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:28:34,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:28:34,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:28:34,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:28:34,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:28:34,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:28:34,615 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:28:34,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:28:34,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:28:34,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:28:34,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:28:34,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:28:34,640 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:28:34,640 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:28:34,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:28:34,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:28:34,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:28:34,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:28:34,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:28:34,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:28:34,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:28:34,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:28:34,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:28:34,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:28:34,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:28:34,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:28:34,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:28:34,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:28:34,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:28:34,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:28:34,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:28:34,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:28:34,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:28:34,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:28:34,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:28:34,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:28:34,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:28:34,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:28:34,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:28:34,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:28:34,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:28:34,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:28:34,720 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:28:34,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor3_true-unreach-call.i [2018-11-23 12:28:34,785 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e2eba8/bee4ef7cdded4c9d9a6a7935155d2955/FLAG770e1bf64 [2018-11-23 12:28:35,266 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:28:35,266 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor3_true-unreach-call.i [2018-11-23 12:28:35,273 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e2eba8/bee4ef7cdded4c9d9a6a7935155d2955/FLAG770e1bf64 [2018-11-23 12:28:35,583 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e2eba8/bee4ef7cdded4c9d9a6a7935155d2955 [2018-11-23 12:28:35,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:28:35,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:28:35,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:28:35,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:28:35,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:28:35,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:35,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e75a9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35, skipping insertion in model container [2018-11-23 12:28:35,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:35,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:28:35,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:28:35,889 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:28:35,901 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:28:35,929 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:28:35,948 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:28:35,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35 WrapperNode [2018-11-23 12:28:35,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:28:35,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:28:35,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:28:35,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:28:35,961 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:28:35" (1/1) ... [2018-11-23 12:28:35,974 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:28:35" (1/1) ... [2018-11-23 12:28:35,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:28:35,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:28:35,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:28:35,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:28:35,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:35,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:35,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:36,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:36,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:36,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:36,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (1/1) ... [2018-11-23 12:28:36,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:28:36,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:28:36,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:28:36,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:28:36,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (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:28:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:28:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:28:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:28:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:28:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:28:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:28:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:28:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-23 12:28:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-23 12:28:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:28:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:28:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:28:36,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:28:36,885 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:28:36,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:36 BoogieIcfgContainer [2018-11-23 12:28:36,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:28:36,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:28:36,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:28:36,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:28:36,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:28:35" (1/3) ... [2018-11-23 12:28:36,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4489c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:36, skipping insertion in model container [2018-11-23 12:28:36,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:35" (2/3) ... [2018-11-23 12:28:36,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4489c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:36, skipping insertion in model container [2018-11-23 12:28:36,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:36" (3/3) ... [2018-11-23 12:28:36,894 INFO L112 eAbstractionObserver]: Analyzing ICFG xor3_true-unreach-call.i [2018-11-23 12:28:36,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:28:36,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:28:36,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:28:36,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:28:36,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:28:36,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:28:36,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:28:36,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:28:36,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:28:36,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:28:36,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:28:36,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:28:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:28:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:28:36,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:36,988 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:28:36,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:36,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 12:28:36,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:37,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:37,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:37,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:28:37,221 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:28:37,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:28:37,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:28:37,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:28:37,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:28:37,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:28:37,236 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:28:37,237 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:28:37,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:28:37,237 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:28:37,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:28:37,238 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:28:37,238 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:28:37,239 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:28:37,239 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:28:37,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:28:37,240 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:28:37,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:28:37,240 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:28:37,241 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:28:37,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:28:37,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:28:37,242 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:28:37,242 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:28:37,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:28:37,243 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:28:37,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:28:37,243 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:28:37,244 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:28:37,244 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:28:37,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:28:37,251 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:28:37,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:28:37,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:28:37,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:28:37,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:37,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:28:37,520 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:28:37,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:28:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:28:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:28:37,534 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:28:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:37,675 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:28:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:28:37,676 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:28:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:28:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:28:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:28:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:28:37,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:28:37,987 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:38,000 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:28:38,001 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:28:38,005 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:28:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:28:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:28:38,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:38,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:28:38,071 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:28:38,071 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:28:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,078 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:28:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:28:38,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,080 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:28:38,081 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:28:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,086 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:28:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:28:38,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:38,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:28:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:28:38,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:28:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:38,093 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:28:38,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:28:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:28:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:28:38,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:38,096 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:28:38,096 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:38,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 12:28:38,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:38,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:38,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:28:38,196 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:28:38,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:28:38,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:28:38,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:28:38,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:38,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10000); {199#false} is VALID [2018-11-23 12:28:38,198 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:28:38,198 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:28:38,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:28:38,199 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:28:38,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:28:38,199 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:28:38,199 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:28:38,200 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:28:38,200 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:28:38,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:28:38,200 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:28:38,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:28:38,201 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:28:38,201 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:28:38,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9999); {199#false} is VALID [2018-11-23 12:28:38,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:28:38,202 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:28:38,203 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:28:38,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:28:38,203 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:28:38,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:28:38,204 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:28:38,204 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:28:38,205 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:28:38,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:28:38,208 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:28:38,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:28:38,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:28:38,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:28:38,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:38,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:28:38,301 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:28:38,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:28:38,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:28:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:28:38,302 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:28:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,828 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:28:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:28:38,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:28:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:28:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:28:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:28:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:28:38,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:28:38,970 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:28:38,972 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:28:38,972 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:28:38,973 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:28:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:28:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:28:38,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:38,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:28:38,989 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:28:38,989 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:28:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,994 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:28:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:28:38,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:38,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:38,995 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:28:38,995 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:28:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,999 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:28:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:28:39,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:39,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:28:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:28:39,003 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:28:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:28:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:28:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:28:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:28:39,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:39,005 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:28:39,006 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:39,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 12:28:39,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:39,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:39,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:39,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:28:39,097 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:28:39,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:28:39,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:28:39,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:28:39,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:28:39,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -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:28:39,099 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:28:39,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:28:39,100 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:28:39,101 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:28:39,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= xor_~i~0 1)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:28:39,103 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:28:39,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:28:39,103 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:28:39,104 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:28:39,104 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:28:39,104 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:28:39,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:28:39,105 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:28:39,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:28:39,106 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:28:39,106 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:28:39,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:28:39,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:28:39,107 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:28:39,107 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:28:39,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:28:39,108 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:28:39,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:28:39,108 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:28:39,109 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:28:39,109 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:28:39,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:28:39,112 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:28:39,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:39,112 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:28:39,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:39,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:39,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:28:39,382 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:28:39,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:28:39,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:28:39,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:28:39,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:28:39,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -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:28:39,384 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:28:39,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:28:39,385 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:28:39,388 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:28:39,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= xor_~i~0 1)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:28:39,390 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:28:39,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:28:39,391 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:28:39,391 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:28:39,391 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:28:39,391 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:28:39,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:28:39,392 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:28:39,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:28:39,392 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:28:39,393 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:28:39,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:28:39,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:28:39,394 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:28:39,394 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:28:39,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:28:39,395 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:28:39,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:28:39,396 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:28:39,397 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:28:39,397 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:28:39,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:28:39,400 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:28:39,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:28:39,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:28:39,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:28:39,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:39,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:28:39,519 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:28:39,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:28:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:28:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:28:39,520 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:28:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,855 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:28:39,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:28:39,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:28:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:28:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:28:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:28:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:28:39,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:28:39,974 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:28:39,976 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:28:39,977 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:28:39,977 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:28:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:28:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:28:39,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:39,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:28:39,996 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:28:39,996 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:28:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,999 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:28:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:28:40,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,001 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:28:40,001 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:28:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,003 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:28:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:28:40,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:40,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:28:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:28:40,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:28:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:40,008 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:28:40,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:28:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:28:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:28:40,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:40,010 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:28:40,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:40,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2018-11-23 12:28:40,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:28:40,118 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:28:40,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:28:40,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:28:40,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:28:40,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 10000);assume -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:28:40,119 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:28:40,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10000); {630#true} is VALID [2018-11-23 12:28:40,120 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:28:40,120 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:28:40,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 10000);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:28:40,121 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:28:40,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:28:40,121 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:28:40,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:28:40,122 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:28:40,122 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:28:40,122 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:28:40,123 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:28:40,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 10000);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:28:40,123 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:28:40,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:28:40,124 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:28:40,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:28:40,124 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:28:40,130 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:28:40,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9999); {631#false} is VALID [2018-11-23 12:28:40,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:28:40,131 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:28:40,132 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:28:40,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 10000);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:28:40,132 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:28:40,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:28:40,133 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:28:40,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:28:40,133 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:28:40,133 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:28:40,134 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:28:40,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:28:40,137 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:28:40,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:28:40,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:28:40,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:28:40,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:40,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:28:40,216 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:28:40,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:28:40,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:28:40,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:28:40,218 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:28:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,313 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:28:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:28:40,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:28:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:28:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:28:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:28:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:28:40,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:28:40,417 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:28:40,418 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:28:40,419 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:28:40,419 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:28:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:28:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:28:40,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:40,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:28:40,468 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:28:40,468 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:28:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,471 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:28:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:28:40,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,472 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:28:40,472 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:28:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,475 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:28:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:28:40,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:40,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:28:40,478 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:28:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:40,479 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:28:40,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:28:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:28:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:28:40,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:40,481 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:28:40,481 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:40,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2018-11-23 12:28:40,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:28:40,614 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:28:40,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:28:40,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:28:40,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:28:40,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:40,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:40,617 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:28:40,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:28:40,619 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:28:40,619 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:28:40,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 10000);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:28:40,620 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:28:40,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:28:40,620 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:28:40,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:28:40,621 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:28:40,621 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:28:40,621 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:28:40,622 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:28:40,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 10000);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:28:40,622 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:28:40,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:28:40,623 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:28:40,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:28:40,623 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:28:40,624 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:28:40,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:40,624 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:28:40,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:28:40,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:28:40,625 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:28:40,625 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:28:40,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 10000);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:28:40,626 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:28:40,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:28:40,626 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:28:40,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:28:40,627 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:28:40,627 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:28:40,627 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:28:40,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:28:40,630 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:28:40,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:40,631 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:28:40,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:40,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:28:40,981 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:28:40,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:28:40,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:28:40,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:28:40,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:40,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:40,985 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:28:40,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:28:40,986 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:28:40,986 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:28:40,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 10000);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:28:40,986 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:28:40,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:28:40,987 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:28:40,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:28:40,988 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:28:40,988 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:28:40,988 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:28:40,989 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:28:40,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 10000);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:28:40,989 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:28:40,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:28:40,990 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:28:40,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:28:40,990 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:28:40,991 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:28:40,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:40,991 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:28:40,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:28:40,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:28:40,992 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:28:40,992 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:28:40,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 10000);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:28:40,992 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:28:40,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:28:40,993 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:28:40,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:28:40,993 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:28:40,994 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:28:40,994 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:28:40,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:28:40,999 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:28:41,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:41,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:28:41,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:28:41,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:41,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:28:41,099 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:28:41,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:28:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:28:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:28:41,100 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:28:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,373 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:28:41,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:28:41,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:28:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:28:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:28:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:28:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:28:41,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:28:41,500 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:28:41,501 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:28:41,502 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:28:41,502 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:28:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:28:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:28:41,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:41,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:28:41,518 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:28:41,518 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:28:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,521 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:28:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:28:41,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,522 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:28:41,522 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:28:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:41,524 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:28:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:28:41,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:41,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:41,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:41,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:28:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:28:41,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:28:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:41,528 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:28:41,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:28:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:28:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:28:41,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:41,529 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:28:41,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:41,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2018-11-23 12:28:41,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:41,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:41,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:41,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:28:41,691 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:28:41,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:28:41,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:28:41,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:41,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:41,701 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:28:41,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:41,702 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:28:41,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:28:41,703 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:28:41,703 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:28:41,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:28:41,703 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:28:41,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:28:41,704 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:28:41,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:28:41,704 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:28:41,704 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:28:41,705 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:28:41,705 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:28:41,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:28:41,705 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:28:41,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:28:41,706 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:28:41,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:28:41,707 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:28:41,707 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:28:41,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:41,707 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:28:41,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:28:41,708 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:28:41,708 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:28:41,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 10000);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:28:41,709 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:28:41,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:28:41,709 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:28:41,709 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:28:41,709 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:28:41,710 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:28:41,710 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:28:41,710 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:28:41,712 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:28:41,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:41,713 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:28:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:41,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:41,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:42,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:28:42,021 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:28:42,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:28:42,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:28:42,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:28:42,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:42,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:42,024 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:28:42,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:42,026 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:28:42,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:28:42,027 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:28:42,028 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:28:42,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:28:42,028 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:28:42,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:28:42,029 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:28:42,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:28:42,030 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:28:42,030 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:28:42,030 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:28:42,031 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:28:42,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:28:42,031 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:28:42,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:28:42,032 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:28:42,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:28:42,032 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:28:42,033 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:28:42,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:42,033 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:28:42,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:28:42,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:28:42,034 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:28:42,034 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:28:42,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 10000);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:28:42,034 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:28:42,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:28:42,035 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:28:42,035 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:28:42,035 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:28:42,036 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:28:42,036 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:28:42,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:28:42,038 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:28:42,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:42,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:28:42,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:28:42,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:42,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:28:42,107 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:28:42,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:28:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:28:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:28:42,109 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:28:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,280 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:28:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:28:42,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:28:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:28:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:28:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:28:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:28:42,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:28:42,499 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:28:42,500 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:28:42,501 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:28:42,504 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:28:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:28:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:28:42,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:42,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:28:42,519 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:28:42,520 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:28:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,522 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:28:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:28:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,524 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:28:42,524 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:28:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,526 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:28:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:28:42,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:42,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:28:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:28:42,529 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:28:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:42,529 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:28:42,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:28:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:28:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:28:42,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:42,531 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:28:42,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:42,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2018-11-23 12:28:42,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:28:42,659 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:28:42,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:28:42,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:28:42,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:42,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:42,669 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:28:42,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:42,671 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:28:42,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:42,674 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:28:42,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1447#false} is VALID [2018-11-23 12:28:42,675 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:28:42,675 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:28:42,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:28:42,676 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:28:42,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,677 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:28:42,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,678 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:28:42,678 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:28:42,679 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:28:42,679 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:28:42,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:28:42,680 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:28:42,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,680 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:28:42,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,681 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:28:42,681 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:28:42,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:42,682 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:28:42,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9999); {1447#false} is VALID [2018-11-23 12:28:42,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:28:42,682 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:28:42,683 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:28:42,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:28:42,683 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:28:42,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,684 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:28:42,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,684 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:28:42,684 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:28:42,685 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:28:42,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:28:42,688 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:28:42,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:42,688 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:28:42,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:42,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:28:42,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:42,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:28:42,933 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:28:42,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:28:42,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:28:42,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:28:42,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:28:42,934 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:28:42,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:28:42,934 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:28:42,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -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:28:42,935 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:28:42,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,935 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:28:42,935 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:28:42,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:28:42,936 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:28:42,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,936 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:28:42,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,936 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:28:42,936 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:28:42,937 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:28:42,937 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:28:42,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);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:28:42,937 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:28:42,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:28:42,937 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:28:42,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:28:42,938 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:28:42,938 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:28:42,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:42,938 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:28:42,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9999); {1446#true} is VALID [2018-11-23 12:28:42,939 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:28:42,939 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:28:42,939 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:28:42,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:28:42,941 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:28:42,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= xor_~i~0 2)} assume !(~i~0 < 10000); {1447#false} is VALID [2018-11-23 12:28:42,941 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:28:42,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:28:42,942 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:28:42,942 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:28:42,942 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:28:42,942 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:28:42,944 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:28:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:42,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:28:42,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:28:42,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:42,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:28:43,081 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:28:43,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:28:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:28:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:28:43,082 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:28:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:43,323 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:28:43,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:28:43,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:28:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:28:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:28:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:28:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:28:43,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:28:43,428 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:28:43,430 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:28:43,430 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:28:43,432 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:28:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:28:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:28:43,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:43,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:28:43,454 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:28:43,454 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:28:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:43,456 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:28:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:28:43,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:43,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:43,457 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:28:43,458 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:28:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:43,460 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:28:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:28:43,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:43,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:43,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:43,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:28:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:28:43,463 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:28:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:43,463 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:28:43,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:28:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:28:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:28:43,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:43,464 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:28:43,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:43,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2018-11-23 12:28:43,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:43,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:43,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:28:43,651 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:28:43,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:28:43,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:28:43,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:28:43,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:43,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:43,653 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:28:43,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:43,654 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:28:43,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:43,655 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:28:43,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:43,657 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:28:43,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:28:43,658 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:28:43,658 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:28:43,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,659 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:28:43,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,659 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:28:43,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:28:43,660 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:28:43,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:28:43,660 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:28:43,660 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:28:43,661 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:28:43,661 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:28:43,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,661 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:28:43,661 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,661 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:28:43,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:28:43,662 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:28:43,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:28:43,662 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:28:43,662 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:28:43,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:43,663 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:28:43,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:28:43,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:28:43,663 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:28:43,663 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:28:43,663 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,664 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:28:43,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 10000);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:28:43,664 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:28:43,664 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:28:43,664 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:28:43,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:28:43,665 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:28:43,665 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:28:43,665 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:28:43,665 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:28:43,668 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:28:43,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:43,668 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:28:43,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:43,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:43,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:44,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:28:44,295 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:28:44,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:28:44,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:28:44,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:28:44,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:44,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:44,298 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:28:44,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:44,299 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:28:44,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:44,301 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:28:44,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:44,307 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:28:44,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:28:44,308 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:28:44,308 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:28:44,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,309 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:28:44,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,309 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:28:44,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:28:44,310 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:28:44,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:28:44,310 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:28:44,310 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:28:44,310 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:28:44,311 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:28:44,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,311 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:28:44,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,312 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:28:44,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:28:44,312 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:28:44,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:28:44,313 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:28:44,313 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:28:44,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:44,313 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:28:44,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:28:44,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:28:44,314 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:28:44,314 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:28:44,315 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,315 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:28:44,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 10000);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:28:44,315 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:28:44,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:28:44,315 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:28:44,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:28:44,316 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:28:44,316 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:28:44,316 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:28:44,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:28:44,319 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:28:44,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:44,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:28:44,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:28:44,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:44,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:28:44,391 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:28:44,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:28:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:28:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:28:44,393 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:28:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,681 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:28:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:28:44,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:28:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:28:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:28:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:28:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:28:44,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:28:44,832 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:28:44,833 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:28:44,834 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:28:44,834 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:28:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:28:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:28:44,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:44,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:28:44,861 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:28:44,861 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:28:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,863 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:28:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:28:44,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,864 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:28:44,864 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:28:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,866 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:28:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:28:44,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:44,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:28:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:28:44,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:28:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:44,870 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:28:44,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:28:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:28:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:28:44,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:44,871 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:28:44,871 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:44,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2018-11-23 12:28:44,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:45,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:28:45,077 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:28:45,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:28:45,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:28:45,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:28:45,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:45,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:45,083 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:28:45,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:45,084 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:28:45,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:45,085 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:28:45,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:45,086 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:28:45,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:45,087 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:28:45,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2207#false} is VALID [2018-11-23 12:28:45,089 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:28:45,089 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:28:45,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,089 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:28:45,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,090 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:28:45,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:28:45,090 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:28:45,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:28:45,091 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:28:45,091 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:28:45,091 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:28:45,092 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:28:45,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,092 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:28:45,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,093 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:28:45,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:28:45,093 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:28:45,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:28:45,093 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:28:45,094 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:28:45,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:45,094 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:28:45,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:28:45,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:28:45,094 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:28:45,095 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:28:45,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,095 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:28:45,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 10000);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:28:45,095 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:28:45,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:28:45,096 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:28:45,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:28:45,096 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:28:45,096 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:28:45,096 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:28:45,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:28:45,099 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:28:45,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:45,100 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:28:45,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:45,162 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:28:45,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:45,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:28:45,338 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:28:45,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:28:45,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:28:45,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:28:45,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:28:45,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:28:45,339 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:28:45,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:28:45,340 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:28:45,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:28:45,340 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:28:45,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:28:45,341 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:28:45,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -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:28:45,341 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:28:45,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 10000); {2206#true} is VALID [2018-11-23 12:28:45,341 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:28:45,342 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:28:45,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:28:45,343 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:28:45,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:28:45,345 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:28:45,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= xor_~i~0 3)} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:28:45,347 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:28:45,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:28:45,348 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:28:45,348 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:28:45,348 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:28:45,348 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:28:45,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:28:45,349 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:28:45,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:28:45,349 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:28:45,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:28:45,349 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:28:45,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:28:45,350 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:28:45,350 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:28:45,350 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:45,350 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:28:45,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:28:45,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:28:45,351 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:28:45,351 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:28:45,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:28:45,352 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:28:45,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 10000);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:28:45,352 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:28:45,352 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:28:45,353 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:28:45,353 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:28:45,353 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:28:45,353 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:28:45,354 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:28:45,354 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:28:45,357 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:28:45,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:45,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:28:45,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:28:45,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:45,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:28:45,592 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:28:45,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:28:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:28:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:45,593 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:28:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,194 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:28:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:28:46,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:28:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:28:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:28:46,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:28:46,305 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:28:46,308 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:28:46,308 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:28:46,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:28:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:28:46,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:46,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:28:46,350 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:28:46,350 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:28:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,353 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:28:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:28:46,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:46,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:46,354 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:28:46,354 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:28:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,356 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:28:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:28:46,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:46,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:46,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:46,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:28:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:28:46,358 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:28:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:46,359 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:28:46,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:28:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:28:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:28:46,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:46,360 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:28:46,360 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:46,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:46,361 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2018-11-23 12:28:46,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:46,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:46,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:46,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:46,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:28:46,730 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:28:46,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:46,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:28:46,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:28:46,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:46,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:46,733 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:28:46,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:46,734 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:28:46,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:46,735 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:28:46,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:46,736 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:28:46,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:46,738 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:28:46,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:46,739 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:28:46,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 10000); {2636#false} is VALID [2018-11-23 12:28:46,740 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:28:46,741 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:28:46,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,741 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:28:46,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,742 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:28:46,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,742 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:28:46,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:28:46,743 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:28:46,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:46,743 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:28:46,743 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:28:46,743 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:28:46,744 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:28:46,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,744 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:28:46,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,744 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:28:46,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,745 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:28:46,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:28:46,745 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:28:46,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:46,745 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:28:46,745 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:28:46,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:46,746 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:28:46,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:28:46,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:28:46,746 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:28:46,746 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:28:46,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,747 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:28:46,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,747 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:28:46,747 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:46,747 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:28:46,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:28:46,748 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:28:46,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:46,748 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:28:46,748 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:28:46,748 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:28:46,748 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:28:46,752 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:28:46,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:46,753 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:28:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:46,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:28:46,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:47,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:28:47,034 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:28:47,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:47,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:28:47,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:28:47,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:28:47,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,036 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:28:47,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,036 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:28:47,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,036 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:28:47,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,036 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:28:47,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,037 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:28:47,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -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:28:47,037 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:28:47,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 10000); {2635#true} is VALID [2018-11-23 12:28:47,037 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:28:47,037 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:28:47,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,037 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:28:47,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,038 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:28:47,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,038 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:28:47,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:28:47,038 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:28:47,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:47,038 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:28:47,039 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:28:47,039 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:28:47,039 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:28:47,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,039 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:28:47,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,039 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:28:47,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);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:28:47,040 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:28:47,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:28:47,040 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:28:47,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:28:47,040 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:28:47,041 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:28:47,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:47,041 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:28:47,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:28:47,042 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:28:47,042 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:28:47,042 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:28:47,042 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:28:47,042 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:28:47,043 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:28:47,043 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:28:47,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 10000);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:28:47,043 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:28:47,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 10000); {2636#false} is VALID [2018-11-23 12:28:47,044 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:28:47,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:28:47,044 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:28:47,044 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:28:47,045 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:28:47,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:28:47,048 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:28:47,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:28:47,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:28:47,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:47,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:28:47,272 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:28:47,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:28:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:28:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:47,273 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:28:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,697 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:28:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:28:47,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:28:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:28:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:28:47,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:28:47,792 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:47,793 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:28:47,793 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:28:47,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:28:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:28:47,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:47,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:28:47,815 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:28:47,815 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:28:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,817 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:28:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:28:47,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:47,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:47,818 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:28:47,818 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:28:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,820 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:28:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:28:47,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:47,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:47,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:47,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:28:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:28:47,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:28:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:47,823 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:28:47,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:28:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:28:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:28:47,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:47,824 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:28:47,824 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:47,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2018-11-23 12:28:47,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:47,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:47,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:47,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:47,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:48,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:28:48,595 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:28:48,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:28:48,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:28:48,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:28:48,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:48,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:48,598 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:28:48,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:48,599 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:28:48,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:48,600 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:28:48,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:48,601 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:28:48,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:48,603 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:28:48,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:48,604 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:28:48,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:48,605 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:28:48,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:28:48,606 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:28:48,606 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:28:48,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,607 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:28:48,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,607 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:28:48,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,607 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:28:48,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:28:48,608 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:28:48,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:28:48,608 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:28:48,608 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:28:48,609 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:28:48,609 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:28:48,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,609 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:28:48,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,610 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:28:48,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,610 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:28:48,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:28:48,611 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:28:48,611 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:28:48,611 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:28:48,611 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:28:48,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:48,612 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:28:48,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:48,612 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:28:48,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:28:48,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:28:48,612 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:28:48,613 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:28:48,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,613 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:28:48,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,613 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:28:48,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 10000);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:28:48,614 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:28:48,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:28:48,614 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:28:48,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:28:48,614 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:28:48,614 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:28:48,615 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:28:48,615 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:28:48,618 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:28:48,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:48,618 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:28:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:48,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:48,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:28:48,807 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:28:48,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:28:48,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:28:48,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:28:48,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:48,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:48,810 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:28:48,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:48,810 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:28:48,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:48,811 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:28:48,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:48,813 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:28:48,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:48,814 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:28:48,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:48,815 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:28:48,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:48,816 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:28:48,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:28:48,817 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:28:48,817 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:28:48,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,818 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:28:48,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,818 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:28:48,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,818 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:28:48,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:28:48,819 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:28:48,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:28:48,819 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:28:48,819 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:28:48,820 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:28:48,820 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:28:48,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,820 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:28:48,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,821 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:28:48,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,821 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:28:48,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:28:48,821 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:28:48,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:28:48,821 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:28:48,822 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:28:48,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:48,822 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:28:48,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:48,822 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:28:48,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:28:48,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:28:48,822 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:28:48,822 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:28:48,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,823 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:28:48,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,823 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:28:48,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 10000);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:28:48,823 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:28:48,823 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:28:48,823 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:28:48,824 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:28:48,824 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:28:48,824 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:28:48,824 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:28:48,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:28:48,827 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:28:48,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:48,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:28:48,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:28:48,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:48,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:28:49,005 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:28:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:28:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:28:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:49,006 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:28:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,240 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:28:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:28:49,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:28:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:28:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:28:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:28:49,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:28:49,332 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:28:49,334 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:28:49,335 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:28:49,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:28:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:28:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:28:49,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:49,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:28:49,359 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:28:49,359 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:28:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,360 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:28:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:28:49,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,361 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:28:49,361 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:28:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,362 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:28:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:28:49,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:49,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:28:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:28:49,365 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:28:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:28:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:28:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:28:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:28:49,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:49,366 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:28:49,366 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:49,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2018-11-23 12:28:49,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:49,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:28:49,621 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:28:49,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:28:49,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:28:49,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:28:49,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:49,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:49,623 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:28:49,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:49,624 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:28:49,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:49,625 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:28:49,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:49,625 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:28:49,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:49,627 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:28:49,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:49,628 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:28:49,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:49,629 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:28:49,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28:49,630 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:28:49,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:28:49,631 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:28:49,631 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:28:49,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,632 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:28:49,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,632 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:28:49,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,633 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:28:49,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:28:49,633 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:28:49,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:28:49,634 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:28:49,634 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:28:49,634 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:28:49,634 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:28:49,634 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,634 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:28:49,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,635 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:28:49,635 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,635 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:28:49,635 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:28:49,635 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:28:49,636 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:28:49,636 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:28:49,636 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:28:49,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:49,636 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:28:49,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:49,637 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:28:49,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:28:49,637 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:28:49,637 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:28:49,637 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:28:49,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,638 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:28:49,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,638 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:28:49,638 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 10000);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:28:49,638 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:28:49,638 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:28:49,638 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:28:49,638 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:28:49,639 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:28:49,639 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:28:49,639 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:28:49,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:28:49,642 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:28:49,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:49,642 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:28:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:49,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:49,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:49,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:28:49,992 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:28:49,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:28:49,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:28:49,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:28:49,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:49,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:49,995 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:28:49,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:49,996 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:28:49,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:49,996 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:28:49,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:49,998 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:28:49,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:49,999 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:28:50,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:50,000 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:28:50,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:50,002 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:28:50,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28:50,003 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:28:50,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:28:50,004 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:28:50,004 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:28:50,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,004 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:28:50,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,005 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:28:50,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,005 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:28:50,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:28:50,005 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:28:50,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:28:50,006 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:28:50,006 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:28:50,006 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:28:50,006 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:28:50,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,006 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:28:50,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,006 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:28:50,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,007 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:28:50,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:28:50,007 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:28:50,007 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:28:50,007 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:28:50,007 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:28:50,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,008 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:28:50,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,008 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:28:50,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:28:50,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:28:50,008 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:28:50,008 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:28:50,008 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,009 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:28:50,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,009 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:28:50,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 10000);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:28:50,009 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:28:50,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:28:50,009 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:28:50,009 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:28:50,009 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:28:50,010 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:28:50,010 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:28:50,010 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:28:50,012 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:28:50,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:50,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:28:50,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:28:50,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:50,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:28:50,087 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:28:50,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:28:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:28:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:28:50,088 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:28:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,270 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:28:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:28:50,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:28:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:28:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:28:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:28:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:28:50,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:28:50,357 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:28:50,359 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:28:50,359 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:28:50,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:28:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:28:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:28:50,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:50,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:28:50,378 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:28:50,378 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:28:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,380 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:28:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:28:50,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,381 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:28:50,381 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:28:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,383 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:28:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:28:50,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:50,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:28:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:28:50,386 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:28:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:50,386 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:28:50,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:28:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:28:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:28:50,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:50,387 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:28:50,387 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:50,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2018-11-23 12:28:50,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:50,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:28:50,676 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:28:50,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:28:50,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:28:50,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:50,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:50,678 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:28:50,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:50,680 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:28:50,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:50,681 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:28:50,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:50,682 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:28:50,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:50,684 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:28:50,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:50,685 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:28:50,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:50,686 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:28:50,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28:50,687 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:28:50,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:28:50,689 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:28:50,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 10000); {4125#false} is VALID [2018-11-23 12:28:50,690 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:28:50,690 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:28:50,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,690 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:28:50,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,691 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:28:50,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,691 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:28:50,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,692 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:28:50,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,692 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:28:50,692 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:28:50,692 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:28:50,693 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:28:50,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,693 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:28:50,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,693 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:28:50,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,694 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:28:50,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,694 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:28:50,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,694 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:28:50,694 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:28:50,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,695 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:28:50,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,695 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:28:50,695 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:28:50,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:28:50,695 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:28:50,695 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:28:50,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,696 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:28:50,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,696 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:28:50,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,696 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:28:50,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,696 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:28:50,696 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,696 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:28:50,697 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:28:50,697 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:28:50,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:28:50,699 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:28:50,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:50,699 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:28:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:50,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:28:50,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:50,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:28:50,898 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:28:50,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:28:50,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,899 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:28:50,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,899 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:28:50,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,900 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:28:50,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,900 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:28:50,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,900 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:28:50,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,901 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:28:50,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,901 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:28:50,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,901 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:28:50,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -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:28:50,901 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:28:50,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,902 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:28:50,902 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:28:50,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,902 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:28:50,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,902 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:28:50,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,902 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:28:50,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,903 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:28:50,903 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,903 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:28:50,903 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:28:50,903 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:28:50,903 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:28:50,903 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,903 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:28:50,904 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,904 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:28:50,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);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:28:50,904 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:28:50,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:28:50,904 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:28:50,904 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:28:50,904 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:28:50,905 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:28:50,905 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,906 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:28:50,906 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:50,907 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:28:50,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:28:50,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:28:50,907 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:28:50,908 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:28:50,908 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:28:50,908 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:28:50,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:28:50,908 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:28:50,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 10000);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:28:50,909 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:28:50,909 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 10000); {4125#false} is VALID [2018-11-23 12:28:50,909 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:28:50,909 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:28:50,910 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:28:50,910 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:28:50,910 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:28:50,910 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:28:50,912 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:28:50,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:50,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:28:50,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:28:50,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:50,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:28:51,012 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:51,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:28:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:28:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:28:51,013 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:28:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,424 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:28:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:28:51,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:28:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:28:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:28:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:28:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:28:51,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:28:51,499 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:28:51,500 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:28:51,501 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:28:51,501 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:28:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:28:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:28:51,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:51,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:28:51,524 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:28:51,524 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:28:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,525 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:28:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:28:51,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,526 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:28:51,526 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:28:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,527 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:28:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:28:51,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:51,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:51,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:51,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:28:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:28:51,530 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:28:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:51,530 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:28:51,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:28:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:28:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:28:51,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:51,531 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:28:51,531 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:51,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2018-11-23 12:28:51,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:51,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:28:52,036 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:28:52,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:28:52,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:28:52,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:52,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:52,038 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:28:52,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:52,039 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:28:52,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:52,040 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:28:52,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:52,041 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:28:52,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:52,042 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:28:52,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:52,043 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:28:52,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:52,044 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:28:52,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28:52,046 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:28:52,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:28:52,047 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:28:52,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:28:52,048 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:28:52,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 10000); {4672#false} is VALID [2018-11-23 12:28:52,049 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:28:52,049 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:28:52,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,050 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:28:52,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,050 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:28:52,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,051 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:28:52,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,051 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:28:52,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,052 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:28:52,052 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:28:52,052 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:28:52,052 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:28:52,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,053 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:28:52,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,053 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:28:52,053 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,053 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:28:52,053 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,053 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:28:52,054 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,054 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:28:52,054 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:28:52,054 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,054 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:28:52,054 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,054 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:28:52,054 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,055 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:28:52,055 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 9999); {4672#false} is VALID [2018-11-23 12:28:52,055 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:28:52,055 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:28:52,055 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:28:52,055 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,055 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:28:52,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,056 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:28:52,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,056 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:28:52,056 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,056 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:28:52,056 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,056 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:28:52,056 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:28:52,056 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:28:52,057 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:28:52,059 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:28:52,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:52,060 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:28:52,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:52,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:52,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:52,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:28:52,285 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:28:52,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:28:52,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:28:52,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:28:52,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,286 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:28:52,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,286 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:28:52,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,287 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:28:52,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,287 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:28:52,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,288 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:28:52,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,288 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:28:52,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,288 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:28:52,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,288 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:28:52,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,289 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:28:52,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -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:28:52,289 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:28:52,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,289 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:28:52,289 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:28:52,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,289 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:28:52,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,290 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:28:52,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,290 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:28:52,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,290 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:28:52,290 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,290 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:28:52,290 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:28:52,291 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:28:52,291 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:28:52,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,291 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:28:52,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,291 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:28:52,291 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);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:28:52,291 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:28:52,292 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:28:52,292 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:28:52,292 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:28:52,292 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:28:52,292 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:28:52,292 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,292 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:28:52,292 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,292 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:28:52,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:52,293 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:28:52,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 9999); {4671#true} is VALID [2018-11-23 12:28:52,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:28:52,293 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:28:52,294 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:28:52,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:28:52,295 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:28:52,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:28:52,295 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:28:52,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:28:52,296 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:28:52,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= xor_~i~0 4)} assume !(~i~0 < 10000); {4672#false} is VALID [2018-11-23 12:28:52,297 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:28:52,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:28:52,297 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:28:52,298 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:28:52,298 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:28:52,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:28:52,303 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:28:52,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:52,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:28:52,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:28:52,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:52,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:28:52,402 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:28:52,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:28:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:28:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:28:52,403 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:28:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,877 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:28:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:28:52,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:28:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:28:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:28:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:28:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:28:52,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:28:52,986 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:52,988 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:28:52,988 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:28:52,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:28:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:28:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:28:53,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:53,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:28:53,023 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:28:53,023 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:28:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:53,025 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:28:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:28:53,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:53,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:53,026 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:28:53,026 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:28:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:53,028 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:28:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:28:53,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:53,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:53,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:53,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:28:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:28:53,031 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:28:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:53,032 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:28:53,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:28:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:28:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:28:53,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:53,033 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:28:53,034 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:53,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2018-11-23 12:28:53,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:53,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:53,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:28:53,356 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:28:53,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:28:53,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:28:53,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:28:53,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:28:53,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:28:53,358 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:28:53,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:28:53,359 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:28:53,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:28:53,359 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:28:53,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:28:53,360 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:28:53,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:28:53,361 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:28:53,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:28:53,363 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:28:53,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:28:53,364 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:28:53,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:28:53,365 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:28:53,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:28:53,386 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:28:53,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:28:53,387 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:28:53,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:28:53,387 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:28:53,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 10000); {5256#false} is VALID [2018-11-23 12:28:53,388 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:28:53,388 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:28:53,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,388 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:28:53,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,389 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:28:53,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,389 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:28:53,389 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,389 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:28:53,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:28:53,389 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:28:53,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:28:53,390 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:28:53,390 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:28:53,390 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:28:53,390 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:28:53,390 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,391 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:28:53,391 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,391 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:28:53,391 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,391 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:28:53,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,392 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:28:53,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:28:53,392 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:28:53,392 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:28:53,392 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:28:53,392 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:28:53,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,393 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:28:53,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,393 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:28:53,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,393 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:28:53,393 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:28:53,393 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:28:53,393 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:28:53,393 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:28:53,394 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,394 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:28:53,394 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,394 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:28:53,394 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,394 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:28:53,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 10000);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:28:53,394 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:28:53,395 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:28:53,395 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:28:53,395 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:28:53,395 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:28:53,395 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:28:53,395 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:28:53,395 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:28:53,398 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:28:53,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:53,399 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:28:53,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:53,696 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:28:53,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:53,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:53,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:28:53,858 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:28:53,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:28:53,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:28:53,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:28:53,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:28:53,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,859 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:28:53,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,859 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:28:53,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,860 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:28:53,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,860 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:28:53,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,860 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:28:53,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,860 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:28:53,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,861 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:28:53,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,861 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:28:53,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,861 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:28:53,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,861 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:28:53,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -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:28:53,862 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:28:53,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 10000); {5255#true} is VALID [2018-11-23 12:28:53,862 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:28:53,862 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:28:53,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:28:53,863 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:28:53,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:28:53,864 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:28:53,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:28:53,865 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:28:53,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:28:53,866 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:28:53,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= xor_~i~0 5)} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:28:53,866 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:28:53,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:28:53,867 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:28:53,867 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:28:53,867 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:28:53,868 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:28:53,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,868 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:28:53,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,868 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:28:53,869 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,869 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:28:53,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,869 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:28:53,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:28:53,870 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:28:53,870 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:28:53,870 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:28:53,870 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:28:53,870 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,871 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:28:53,871 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,871 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:28:53,871 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:28:53,871 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:28:53,872 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:28:53,872 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:28:53,872 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:28:53,872 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:28:53,872 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,872 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:28:53,872 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,872 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:28:53,872 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,873 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:28:53,873 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 10000);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:28:53,873 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:28:53,873 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:28:53,873 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:28:53,873 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:28:53,874 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:28:53,874 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:28:53,874 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:28:53,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:28:53,878 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:28:53,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:53,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:28:53,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:28:53,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:53,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:28:54,000 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:28:54,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:28:54,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:28:54,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:28:54,001 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:28:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:54,544 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:28:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:28:54,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:28:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:28:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:28:54,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:28:55,545 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:28:55,548 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:28:55,548 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:28:55,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:28:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:28:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:28:55,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:55,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:28:55,579 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:28:55,580 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:28:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:55,583 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:28:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:28:55,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:55,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:55,584 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:28:55,584 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:28:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:55,586 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:28:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:28:55,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:55,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:55,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:55,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:28:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:28:55,589 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:28:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:55,590 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:28:55,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:28:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:28:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:28:55,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:55,591 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:28:55,592 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:55,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2018-11-23 12:28:55,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:55,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:55,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:55,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:55,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:56,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:28:56,203 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:56,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:28:56,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:28:56,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:56,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:56,205 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:56,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:56,206 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:56,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:56,207 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:56,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:56,210 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:56,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:56,211 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:56,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:56,212 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:56,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:56,213 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:56,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:56,215 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:56,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:56,216 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:56,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:56,217 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:56,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:56,218 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:56,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:56,220 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:56,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 10000); {5889#false} is VALID [2018-11-23 12:28:56,221 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:56,221 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:56,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,221 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:56,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,222 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:56,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,222 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:56,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,222 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:56,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,223 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:56,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,223 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:56,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,224 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:28:56,224 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:56,224 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:56,224 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:56,224 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,225 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:56,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,225 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:56,225 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,225 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:56,225 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,225 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:56,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,226 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:56,226 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,226 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:56,226 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,226 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:28:56,226 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:56,226 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,226 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:56,227 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,227 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:56,227 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,227 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:56,227 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:28:56,227 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:28:56,227 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:56,227 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:56,227 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,228 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:56,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,228 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:56,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,228 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:56,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,228 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:56,228 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,228 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:56,229 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,229 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:56,229 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,229 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:28:56,229 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:56,229 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:56,229 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:28:56,233 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:56,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:56,233 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:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:56,395 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:28:56,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:56,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:28:56,620 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:56,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:28:56,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:28:56,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:28:56,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,620 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:56,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,621 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:56,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,621 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:56,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,621 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:56,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,621 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:56,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,622 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:56,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,622 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:56,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,622 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:56,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,622 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:56,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,623 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:56,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,623 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:56,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -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:56,623 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:56,623 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,623 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:56,623 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:56,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,624 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:56,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,624 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:56,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,624 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:56,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,624 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:56,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,624 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:56,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,625 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:56,625 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,625 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:28:56,625 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:56,625 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:56,625 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:56,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,626 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:56,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,626 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:56,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,626 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:56,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,626 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:56,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);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:56,626 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:56,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:28:56,627 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:56,627 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:28:56,627 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:28:56,627 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:56,628 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,628 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:56,629 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,629 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:56,629 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:56,630 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:56,630 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:28:56,630 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:28:56,630 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:56,631 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:56,631 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:56,631 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:56,631 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:56,631 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:56,631 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:56,631 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:56,631 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:56,632 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:56,632 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 10000);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:56,632 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:56,632 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 10000); {5889#false} is VALID [2018-11-23 12:28:56,633 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:56,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:28:56,633 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:28:56,634 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:56,634 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:56,634 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:28:56,638 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:56,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:56,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:28:56,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:28:56,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:56,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:28:56,733 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:56,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:28:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:28:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:28:56,734 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:28:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:57,311 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:28:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:28:57,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:28:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:28:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:28:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:28:57,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:28:58,191 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:58,194 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:28:58,194 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:28:58,195 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:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:28:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:28:58,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:58,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:58,220 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:58,220 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:28:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,222 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:28:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:28:58,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,223 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:28:58,223 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:28:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,225 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:28:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:28:58,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:58,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:28:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:28:58,228 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:28:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:58,228 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:28:58,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:28:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:28:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:28:58,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:58,230 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:58,230 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:58,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2018-11-23 12:28:58,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:28:59,134 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:59,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:59,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:28:59,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:28:59,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:59,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:59,136 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:59,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:59,137 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:59,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:59,138 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:59,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:59,139 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:59,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:59,140 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:59,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:59,142 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:59,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:59,143 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:59,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:59,144 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:59,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:59,146 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:59,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:59,147 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:59,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:59,148 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:59,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:59,150 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:59,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:59,151 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:59,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:28:59,152 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:59,152 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:59,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,152 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:59,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,153 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:59,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,153 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:59,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,154 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:59,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,154 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:59,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:28:59,154 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:59,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:59,155 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:28:59,155 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:59,155 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:59,155 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:59,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,156 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:59,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,156 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:59,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,157 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:59,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,157 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:59,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,157 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:59,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:28:59,157 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:59,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:59,157 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:28:59,158 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:59,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,158 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:59,158 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,158 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:59,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,158 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:59,158 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,158 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:59,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:28:59,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:59,159 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:59,159 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:59,159 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,159 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:59,159 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,159 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:59,160 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,160 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:59,160 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,160 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:59,160 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 10000);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:59,160 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:59,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:28:59,160 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:59,160 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:59,161 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:28:59,161 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:59,161 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:59,161 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:28:59,165 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:59,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:59,166 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:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:59,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:28:59,694 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:59,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:28:59,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:28:59,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:28:59,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:59,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:59,696 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:59,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:59,698 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:59,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:59,699 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:59,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:59,700 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:59,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:59,702 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:59,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:59,703 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:59,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:59,704 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:59,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:59,706 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:59,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:59,707 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:59,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:59,708 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:59,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:59,709 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:59,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:59,711 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:59,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:59,712 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:59,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:28:59,713 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:59,713 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:59,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,714 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:59,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,714 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:59,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,714 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:59,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,715 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:59,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,715 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:59,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:28:59,715 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:59,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:59,716 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:28:59,716 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:59,716 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:59,717 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:59,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,717 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:59,717 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,717 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:59,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,718 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:59,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,718 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:59,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,718 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:59,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:28:59,718 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:59,718 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:59,719 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:28:59,719 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:59,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,719 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:59,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,719 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:59,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,719 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:59,719 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:59,720 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:59,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:28:59,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:28:59,720 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:59,720 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:59,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,720 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:59,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,720 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:59,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,721 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:59,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,721 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:59,721 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 10000);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:59,721 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:59,721 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:28:59,721 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:59,721 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:28:59,722 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:28:59,722 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:59,722 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:59,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:28:59,726 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:59,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:59,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:28:59,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:28:59,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:59,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:28:59,830 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:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:28:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:28:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:28:59,831 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:29:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:00,541 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:29:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:29:00,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:29:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:29:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:29:00,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:29:01,032 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:29:01,035 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:29:01,036 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:29:01,036 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:29:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:29:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:29:01,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:01,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:01,063 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:01,063 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:01,067 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:29:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:29:01,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:01,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:01,068 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:29:01,068 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:29:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:01,070 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:29:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:29:01,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:01,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:01,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:01,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:29:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:29:01,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:29:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:01,073 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:29:01,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:29:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:29:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:29:01,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:01,074 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:29:01,074 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:01,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2018-11-23 12:29:01,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:01,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:01,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:29:01,695 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:29:01,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:01,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:29:01,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:29:01,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:01,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:01,698 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:29:01,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:01,699 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:29:01,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:01,700 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:29:01,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:01,700 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:29:01,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:01,702 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:29:01,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:01,703 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:29:01,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:01,704 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:29:01,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:01,706 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:29:01,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:01,707 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:29:01,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:01,708 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:29:01,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:01,709 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:29:01,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:01,711 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:29:01,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:01,712 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:29:01,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:01,713 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:29:01,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:29:01,714 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:29:01,714 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:29:01,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,715 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:29:01,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,715 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:29:01,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,716 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:29:01,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,716 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:29:01,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,716 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:29:01,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:29:01,717 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:29:01,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:01,717 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:29:01,717 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:29:01,718 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:29:01,718 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:29:01,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,718 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:29:01,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,718 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:29:01,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,719 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:29:01,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,719 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:29:01,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,719 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:29:01,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:29:01,719 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:29:01,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:01,720 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:29:01,720 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:29:01,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:01,720 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:29:01,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:01,720 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:29:01,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:01,720 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:29:01,721 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:01,721 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:29:01,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:29:01,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:01,721 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:29:01,721 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:29:01,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,721 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:29:01,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,722 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:29:01,722 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,722 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:29:01,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,722 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:29:01,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 10000);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:29:01,722 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:29:01,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:29:01,722 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:29:01,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:01,723 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:29:01,723 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:29:01,723 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:29:01,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:29:01,727 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:29:01,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:01,728 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:29:01,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:01,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:01,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:01,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:02,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:29:02,035 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:29:02,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:02,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:29:02,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:29:02,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:02,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:02,038 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:29:02,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:02,039 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:29:02,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:02,040 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:29:02,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:02,041 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:29:02,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:02,042 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:29:02,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:02,043 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:29:02,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:02,045 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:29:02,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:02,046 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:29:02,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:02,047 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:29:02,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:02,048 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:29:02,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:02,050 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:29:02,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:02,051 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:29:02,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:02,052 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:29:02,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:02,054 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:29:02,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:29:02,055 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:29:02,055 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:29:02,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,055 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:29:02,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,056 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:29:02,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,056 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:29:02,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,056 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:29:02,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,057 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:29:02,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:29:02,057 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:29:02,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:02,058 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:29:02,058 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:29:02,058 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:29:02,058 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:29:02,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,059 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:29:02,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,059 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:29:02,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,059 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:29:02,059 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,059 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:29:02,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,060 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:29:02,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:29:02,060 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:29:02,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:02,060 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:29:02,060 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:29:02,060 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:02,060 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:29:02,061 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:02,061 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:29:02,061 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:02,061 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:29:02,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:02,061 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:29:02,061 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:29:02,061 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:02,061 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:29:02,062 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:29:02,062 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,062 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:29:02,062 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,062 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:29:02,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,062 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:29:02,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,062 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:29:02,063 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 10000);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:29:02,063 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:29:02,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:29:02,063 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:29:02,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:02,063 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:29:02,063 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:29:02,063 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:29:02,064 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:29:02,068 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:29:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:29:02,088 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:29:02,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:02,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:29:02,157 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:29:02,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:29:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:29:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:29:02,159 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:29:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,614 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:29:02,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:29:02,614 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:29:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:29:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:29:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:29:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:29:02,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:29:02,717 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:29:02,719 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:29:02,719 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:29:02,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:29:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:29:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:29:02,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:02,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:02,750 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:02,750 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,752 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:29:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:29:02,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:02,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:02,753 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:29:02,753 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:29:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:02,755 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:29:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:29:02,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:02,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:02,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:02,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:29:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:29:02,758 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:29:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:02,758 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:29:02,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:29:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:29:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:29:02,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:02,759 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:29:02,759 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:02,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2018-11-23 12:29:02,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:02,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:02,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:03,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:29:03,036 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:29:03,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:29:03,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:29:03,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:03,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:03,038 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:29:03,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:03,039 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:29:03,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:03,040 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:29:03,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:03,041 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:29:03,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:03,042 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:29:03,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:03,043 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:29:03,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:03,045 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:29:03,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:03,046 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:29:03,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:03,047 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:29:03,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:03,048 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:29:03,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:03,050 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:29:03,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:03,051 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:29:03,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:03,052 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:29:03,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:03,054 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:29:03,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:03,055 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:29:03,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 10000); {7986#false} is VALID [2018-11-23 12:29:03,056 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:29:03,056 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:29:03,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,056 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:29:03,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,057 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:29:03,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,057 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:29:03,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,058 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:29:03,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,058 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:29:03,058 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,058 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:29:03,059 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,059 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:29:03,059 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:29:03,059 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:29:03,059 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:29:03,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,059 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:29:03,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,060 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:29:03,060 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,060 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:29:03,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,060 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:29:03,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,060 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:29:03,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,060 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:29:03,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,061 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:29:03,061 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:29:03,061 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,061 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:29:03,061 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,061 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:29:03,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,062 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:29:03,062 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,062 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:29:03,062 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 9999); {7986#false} is VALID [2018-11-23 12:29:03,062 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:29:03,062 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:29:03,062 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:29:03,062 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,062 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:29:03,063 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,063 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:29:03,063 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,063 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:29:03,063 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,063 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:29:03,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,063 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:29:03,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,064 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:29:03,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,064 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:29:03,064 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:29:03,064 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:29:03,064 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:29:03,069 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:29:03,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:03,069 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:29:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:03,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:29:03,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:03,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:03,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:29:03,361 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:29:03,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:29:03,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:29:03,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:29:03,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,362 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:29:03,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,363 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:29:03,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,363 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:29:03,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,364 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:29:03,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,364 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:29:03,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,364 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:29:03,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,364 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:29:03,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,364 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:29:03,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,365 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:29:03,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,365 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:29:03,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,365 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:29:03,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,365 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:29:03,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,366 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:29:03,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,366 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:29:03,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -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:29:03,366 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:29:03,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,366 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:29:03,366 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:29:03,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,367 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:29:03,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,367 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:29:03,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,367 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:29:03,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,367 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:29:03,367 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,367 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:29:03,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,368 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:29:03,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,368 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:29:03,368 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:29:03,368 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:29:03,368 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:29:03,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,369 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:29:03,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,369 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:29:03,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,369 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:29:03,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,369 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:29:03,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);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:29:03,369 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:29:03,370 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:29:03,370 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:29:03,370 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:03,370 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:29:03,370 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:29:03,370 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,370 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:29:03,370 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,370 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:29:03,371 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,371 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:29:03,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:03,371 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:29:03,371 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 9999); {7985#true} is VALID [2018-11-23 12:29:03,371 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:29:03,371 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:29:03,372 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:29:03,372 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:29:03,373 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:29:03,373 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:29:03,373 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:29:03,374 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:29:03,375 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:29:03,375 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:29:03,376 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:29:03,377 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:29:03,377 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:29:03,378 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= xor_~i~0 6)} assume !(~i~0 < 10000); {7986#false} is VALID [2018-11-23 12:29:03,378 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:29:03,378 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:29:03,379 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:29:03,379 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:29:03,379 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:29:03,379 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:29:03,384 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:29:03,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:29:03,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:29:03,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:03,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:29:03,523 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:29:03,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:29:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:29:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:03,524 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:29:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:03,897 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:29:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:29:03,897 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:29:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:29:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:29:03,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:29:04,017 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:29:04,019 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:29:04,019 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:29:04,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:29:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:29:04,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:04,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:04,047 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:04,049 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:29:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:04,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:04,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:04,050 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:29:04,050 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:29:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:04,051 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:29:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:04,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:04,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:04,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:04,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:29:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:29:04,054 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:29:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:04,055 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:29:04,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:29:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:29:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:29:04,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:04,056 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:29:04,056 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:04,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2018-11-23 12:29:04,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:04,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:04,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:04,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:29:04,515 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:29:04,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:04,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:29:04,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:29:04,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:04,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:04,516 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:29:04,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:04,517 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:29:04,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:04,518 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:29:04,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:04,518 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:29:04,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:04,520 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:29:04,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:04,521 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:29:04,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:04,522 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:29:04,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:04,524 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:29:04,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:04,525 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:29:04,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:04,526 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:29:04,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:04,527 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:29:04,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:04,529 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:29:04,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:04,530 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:29:04,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:04,531 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:29:04,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:04,533 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:29:04,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:04,534 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:29:04,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:29:04,535 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:29:04,535 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:29:04,535 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,535 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:29:04,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,536 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:29:04,536 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,536 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:29:04,536 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,537 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:29:04,537 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,537 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:29:04,537 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,537 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:29:04,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:29:04,538 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:29:04,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:04,538 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:29:04,538 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:29:04,538 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:29:04,538 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:29:04,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,538 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:29:04,539 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,539 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:29:04,539 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,539 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:29:04,539 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,539 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:29:04,539 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,539 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:29:04,540 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,540 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:29:04,540 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:29:04,540 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:29:04,540 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:04,540 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:29:04,540 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:29:04,540 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,540 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:29:04,541 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,541 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:29:04,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,541 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:29:04,541 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,541 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:29:04,541 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:29:04,541 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:04,541 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:29:04,542 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:29:04,542 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,542 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:29:04,542 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,542 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:29:04,542 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,542 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:29:04,542 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,542 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:29:04,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,543 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:29:04,543 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 10000);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:29:04,543 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:29:04,543 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:29:04,543 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:29:04,543 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:04,543 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:29:04,543 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:29:04,544 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:29:04,544 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:29:04,549 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:29:04,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:04,549 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:29:04,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:04,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:04,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:04,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:04,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:29:04,822 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:29:04,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:04,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:29:04,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:29:04,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:04,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:04,824 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:29:04,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:04,825 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:29:04,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:04,826 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:29:04,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:04,827 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:29:04,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:04,828 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:29:04,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:04,830 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:29:04,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:04,831 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:29:04,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:04,832 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:29:04,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:04,834 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:29:04,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:04,835 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:29:04,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:04,836 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:29:04,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:04,838 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:29:04,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:04,839 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:29:04,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:04,843 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:29:04,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:04,844 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:29:04,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:04,845 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:29:04,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:29:04,845 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:29:04,845 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:29:04,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,845 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:29:04,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,846 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:29:04,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,846 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:29:04,846 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,846 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:29:04,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,847 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:29:04,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,847 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:29:04,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:29:04,847 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:29:04,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:04,848 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:29:04,848 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:29:04,848 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:29:04,848 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:29:04,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,849 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:29:04,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,849 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:29:04,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,849 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:29:04,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,849 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:29:04,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,849 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:29:04,850 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,850 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:29:04,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:29:04,850 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:29:04,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:04,850 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:29:04,850 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:29:04,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,850 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:29:04,851 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,851 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:29:04,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,851 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:29:04,851 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:04,851 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:29:04,851 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:29:04,851 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:04,851 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:29:04,852 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:29:04,852 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,852 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:29:04,852 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,852 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:29:04,852 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,852 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:29:04,852 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,852 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:29:04,853 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,853 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:29:04,853 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 10000);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:29:04,853 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:29:04,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:29:04,853 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:29:04,853 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:04,853 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:29:04,854 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:29:04,854 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:29:04,854 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:29:04,859 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:29:04,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:04,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:29:04,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:29:04,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:04,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:29:04,956 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:29:04,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:29:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:29:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:29:04,957 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:29:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:05,573 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:29:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:29:05,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:29:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:29:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:29:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:29:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:29:05,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:29:05,826 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:29:05,828 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:29:05,828 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:29:05,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:29:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:29:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:29:05,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:05,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:05,856 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:05,856 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:05,858 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:29:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:29:05,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:05,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:05,858 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:29:05,858 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:29:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:05,860 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:29:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:29:05,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:05,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:05,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:05,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:29:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:29:05,863 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:29:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:05,863 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:29:05,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:29:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:29:05,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:05,864 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:29:05,865 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:05,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2018-11-23 12:29:05,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:05,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:06,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:29:06,898 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:29:06,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:06,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:29:06,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:29:06,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:06,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:06,900 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:29:06,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:06,901 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:29:06,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:06,902 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:29:06,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:06,902 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:29:06,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:06,904 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:29:06,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:06,905 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:29:06,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:06,906 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:29:06,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:06,908 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:29:06,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:06,909 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:29:06,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:06,910 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:29:06,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:06,912 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:29:06,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:06,913 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:29:06,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:06,914 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:29:06,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:06,915 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:29:06,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:06,917 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:29:06,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:06,918 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:29:06,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:06,919 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:29:06,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 10000); {9520#false} is VALID [2018-11-23 12:29:06,920 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:29:06,920 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:29:06,921 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,921 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:29:06,921 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,921 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:29:06,921 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,922 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:29:06,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,922 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:29:06,922 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,922 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:29:06,922 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,923 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:29:06,923 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:29:06,923 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:29:06,923 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:06,923 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:29:06,923 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:29:06,923 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:29:06,923 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:29:06,923 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,924 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:29:06,924 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,924 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:29:06,924 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,924 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:29:06,924 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,924 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:29:06,924 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,924 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:29:06,925 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,925 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:29:06,925 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:29:06,925 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:29:06,925 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:06,925 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:29:06,925 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:29:06,925 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:06,926 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:29:06,926 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:06,926 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:29:06,926 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:06,926 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:29:06,926 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:06,926 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:29:06,926 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:29:06,926 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:29:06,927 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:29:06,927 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:29:06,927 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,927 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:29:06,927 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,927 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:29:06,927 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,927 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:29:06,927 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,928 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:29:06,928 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,928 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:29:06,928 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 10000);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:29:06,928 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:29:06,928 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:29:06,928 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:29:06,928 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:06,928 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:29:06,929 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:29:06,929 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:29:06,929 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:29:06,934 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:29:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:06,935 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:29:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:07,631 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:29:07,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:07,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:07,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:29:07,903 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:29:07,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:07,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:29:07,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:29:07,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:29:07,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,905 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:29:07,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,905 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:29:07,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,906 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:29:07,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,906 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:29:07,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,906 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:29:07,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,907 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:29:07,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,907 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:29:07,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,907 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:29:07,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,908 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:29:07,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,908 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:29:07,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,908 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:29:07,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,909 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:29:07,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,909 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:29:07,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,909 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:29:07,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,910 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:29:07,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,910 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:29:07,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -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:29:07,910 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:29:07,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 10000); {9519#true} is VALID [2018-11-23 12:29:07,911 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:29:07,929 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:29:07,937 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:29:07,938 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:29:07,942 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:29:07,942 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:29:07,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:29:07,943 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:29:07,943 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:29:07,944 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:29:07,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:29:07,944 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:29:07,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:29:07,945 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:29:07,946 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= xor_~i~0 7)} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:29:07,946 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:29:07,946 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:29:07,946 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:29:07,946 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:29:07,946 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:29:07,947 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:29:07,947 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,947 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:29:07,947 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,947 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:29:07,948 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,948 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:29:07,948 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,948 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:29:07,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,949 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:29:07,949 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,949 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:29:07,949 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:29:07,949 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:29:07,949 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:29:07,950 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:29:07,950 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:29:07,950 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:07,950 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:29:07,950 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:07,950 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:29:07,951 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:07,951 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:29:07,951 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:07,951 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:29:07,951 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:29:07,951 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:29:07,951 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:29:07,951 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:29:07,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,952 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:29:07,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,952 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:29:07,952 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,952 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:29:07,952 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,952 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:29:07,952 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,952 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:29:07,953 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 10000);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:29:07,953 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:29:07,953 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:29:07,953 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:29:07,953 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:29:07,953 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:29:07,953 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:29:07,953 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:29:07,953 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:29:07,958 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:29:07,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:07,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:29:07,979 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:29:07,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:07,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:29:08,077 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:29:08,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:29:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:29:08,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:29:08,078 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:29:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,425 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:29:09,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:29:09,425 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:29:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:29:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:29:09,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:29:09,554 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:29:09,556 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:29:09,556 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:29:09,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:29:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:29:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:29:09,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:09,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:09,599 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:09,599 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,601 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:29:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:29:09,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:09,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:09,602 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:29:09,602 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:29:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:09,604 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:29:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:29:09,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:09,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:09,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:09,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:29:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:29:09,606 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:29:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:09,607 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:29:09,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:29:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:29:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:29:09,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:09,608 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:29:09,608 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:09,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2018-11-23 12:29:09,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:09,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:09,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:09,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:29:09,973 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:29:09,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:09,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:29:09,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:29:09,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:09,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:09,975 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:29:09,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:09,976 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:29:09,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:09,977 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:29:09,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:09,978 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:29:09,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:09,979 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:29:09,980 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:09,981 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:29:09,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:09,982 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:29:09,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:09,986 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:29:09,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:09,988 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:29:09,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:09,989 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:29:09,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:09,989 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:29:09,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:09,990 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:29:09,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:09,994 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:29:09,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:09,995 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:29:09,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:09,995 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:29:09,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:09,996 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:29:09,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:09,997 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:29:09,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:09,998 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:29:09,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 10000); {10338#false} is VALID [2018-11-23 12:29:09,999 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:29:10,000 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:29:10,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,000 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:29:10,000 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,000 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:29:10,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,001 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:29:10,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,001 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:29:10,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,002 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:29:10,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,002 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:29:10,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,002 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:29:10,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,003 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:29:10,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,003 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:29:10,003 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:29:10,004 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:29:10,004 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:29:10,004 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,004 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:29:10,004 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,005 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:29:10,005 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,005 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:29:10,005 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,005 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:29:10,005 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,005 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:29:10,006 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,006 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:29:10,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,006 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:29:10,006 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,006 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:29:10,006 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,006 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:29:10,007 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:29:10,007 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,007 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:29:10,007 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,007 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:29:10,007 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,007 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:29:10,007 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,007 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:29:10,008 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:29:10,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:29:10,008 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:29:10,008 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:29:10,008 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,008 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:29:10,008 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,008 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:29:10,008 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,009 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:29:10,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,009 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:29:10,009 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,009 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:29:10,009 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,009 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:29:10,009 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,009 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:29:10,010 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,010 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:29:10,010 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,010 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:29:10,010 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:29:10,010 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:29:10,010 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:29:10,017 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:29:10,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:10,017 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:29:10,026 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:10,164 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:29:10,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:10,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:10,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:29:10,604 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:29:10,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:29:10,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:29:10,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:29:10,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,605 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:29:10,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,605 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:29:10,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,605 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:29:10,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,606 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:29:10,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,606 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:29:10,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,606 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:29:10,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,606 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:29:10,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,607 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:29:10,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,607 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:29:10,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,607 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:29:10,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,607 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:29:10,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,608 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:29:10,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,608 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:29:10,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,608 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:29:10,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,608 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:29:10,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,608 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:29:10,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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:29:10,609 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:29:10,609 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -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 10000)} is VALID [2018-11-23 12:29:10,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {10481#(< main_~i~1 10000)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10485#(<= main_~i~1 10000)} is VALID [2018-11-23 12:29:10,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {10485#(<= main_~i~1 10000)} assume !(~i~1 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,610 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:29:10,610 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:29:10,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,610 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:29:10,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,611 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:29:10,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,611 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:29:10,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,611 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:29:10,611 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,611 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:29:10,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,611 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:29:10,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,612 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:29:10,612 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,612 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:29:10,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,612 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:29:10,612 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:29:10,612 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:29:10,613 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:29:10,613 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,613 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:29:10,613 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,613 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:29:10,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,613 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:29:10,613 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,613 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:29:10,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,614 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:29:10,614 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,614 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:29:10,614 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);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:29:10,614 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:29:10,614 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:29:10,614 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:29:10,614 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:29:10,615 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:29:10,615 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:29:10,615 INFO L273 TraceCheckUtils]: 85: Hoare triple {10615#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,616 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:29:10,616 INFO L273 TraceCheckUtils]: 87: Hoare triple {10622#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,617 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:29:10,617 INFO L273 TraceCheckUtils]: 89: Hoare triple {10629#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,618 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:29:10,618 INFO L273 TraceCheckUtils]: 91: Hoare triple {10636#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:10,618 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:29:10,619 INFO L273 TraceCheckUtils]: 93: Hoare triple {10643#(<= main_~i~2 4)} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:29:10,619 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:29:10,620 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:29:10,620 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:29:10,620 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,620 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:29:10,620 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,621 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:29:10,621 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,621 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:29:10,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,621 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:29:10,622 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,622 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:29:10,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,622 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:29:10,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 10000);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:29:10,622 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:29:10,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 10000); {10338#false} is VALID [2018-11-23 12:29:10,623 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:29:10,623 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:29:10,623 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:29:10,623 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:29:10,623 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:29:10,623 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:29:10,628 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:29:10,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:10,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-11-23 12:29:10,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-11-23 12:29:10,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:10,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:29:10,760 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:29:10,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:29:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:29:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:29:10,761 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2018-11-23 12:29:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:11,891 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-11-23 12:29:11,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:29:11,892 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-11-23 12:29:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:29:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 103 transitions. [2018-11-23 12:29:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:29:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 103 transitions. [2018-11-23 12:29:11,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 103 transitions. [2018-11-23 12:29:12,240 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:29:12,243 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:29:12,243 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:29:12,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:29:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:29:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:29:12,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:12,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:12,290 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:12,291 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:12,296 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:29:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:29:12,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:12,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:12,297 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:29:12,297 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:29:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:12,301 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:29:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:29:12,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:12,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:12,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:12,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:29:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:29:12,305 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 118 [2018-11-23 12:29:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:12,305 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:29:12,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:29:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:29:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:29:12,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:12,306 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:29:12,306 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:12,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 19 times [2018-11-23 12:29:12,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:12,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {11220#true} call ULTIMATE.init(); {11220#true} is VALID [2018-11-23 12:29:12,677 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:29:12,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:29:12,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11220#true} {11220#true} #66#return; {11220#true} is VALID [2018-11-23 12:29:12,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {11220#true} call #t~ret13 := main(); {11220#true} is VALID [2018-11-23 12:29:12,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {11220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:12,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {11222#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:12,679 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:29:12,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {11223#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:12,680 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:29:12,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {11224#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:12,681 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:29:12,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {11225#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:12,682 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:29:12,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {11226#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:12,683 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:29:12,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {11227#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:12,685 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:29:12,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {11228#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:12,686 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:29:12,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {11229#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:12,687 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:29:12,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {11230#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:12,688 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:29:12,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {11231#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:12,690 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:29:12,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {11232#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:12,691 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:29:12,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {11233#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:12,693 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:29:12,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {11234#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:12,694 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:29:12,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {11235#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:12,696 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:29:12,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {11236#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:12,697 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:29:12,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {11237#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:12,699 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:29:12,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {11238#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:12,700 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:29:12,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {11239#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:12,702 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:29:12,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {11240#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:12,703 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:29:12,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {11241#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:12,705 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:29:12,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {11242#(<= main_~i~1 20)} assume !(~i~1 < 10000); {11221#false} is VALID [2018-11-23 12:29:12,706 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:29:12,706 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:29:12,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,707 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:29:12,707 INFO L273 TraceCheckUtils]: 51: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,707 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:29:12,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,708 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:29:12,708 INFO L273 TraceCheckUtils]: 55: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,708 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:29:12,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,709 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:29:12,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,709 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:29:12,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,709 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:29:12,710 INFO L273 TraceCheckUtils]: 63: Hoare triple {11220#true} assume !(~i~0 < 10000); {11220#true} is VALID [2018-11-23 12:29:12,710 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:29:12,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:29:12,710 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11220#true} {11221#false} #70#return; {11221#false} is VALID [2018-11-23 12:29:12,710 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:29:12,710 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:29:12,710 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:29:12,711 INFO L273 TraceCheckUtils]: 70: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,711 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:29:12,711 INFO L273 TraceCheckUtils]: 72: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,711 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:29:12,711 INFO L273 TraceCheckUtils]: 74: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,711 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:29:12,712 INFO L273 TraceCheckUtils]: 76: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,712 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:29:12,712 INFO L273 TraceCheckUtils]: 78: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,712 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:29:12,712 INFO L273 TraceCheckUtils]: 80: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,712 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:29:12,712 INFO L273 TraceCheckUtils]: 82: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,713 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:29:12,713 INFO L273 TraceCheckUtils]: 84: Hoare triple {11220#true} assume !(~i~0 < 10000); {11220#true} is VALID [2018-11-23 12:29:12,713 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:29:12,713 INFO L273 TraceCheckUtils]: 86: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:29:12,713 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {11220#true} {11221#false} #72#return; {11221#false} is VALID [2018-11-23 12:29:12,713 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:29:12,713 INFO L273 TraceCheckUtils]: 89: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:12,714 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:29:12,714 INFO L273 TraceCheckUtils]: 91: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:12,714 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:29:12,714 INFO L273 TraceCheckUtils]: 93: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:12,714 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:29:12,714 INFO L273 TraceCheckUtils]: 95: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:12,715 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:29:12,715 INFO L273 TraceCheckUtils]: 97: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:12,715 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:29:12,715 INFO L273 TraceCheckUtils]: 99: Hoare triple {11221#false} assume !(~i~2 < 9999); {11221#false} is VALID [2018-11-23 12:29:12,715 INFO L273 TraceCheckUtils]: 100: Hoare triple {11221#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:29:12,715 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:29:12,715 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:29:12,716 INFO L273 TraceCheckUtils]: 103: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,716 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:29:12,716 INFO L273 TraceCheckUtils]: 105: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,716 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:29:12,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,716 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:29:12,716 INFO L273 TraceCheckUtils]: 109: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,717 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:29:12,717 INFO L273 TraceCheckUtils]: 111: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,717 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:29:12,717 INFO L273 TraceCheckUtils]: 113: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,717 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:29:12,717 INFO L273 TraceCheckUtils]: 115: Hoare triple {11220#true} assume !!(~i~0 < 10000);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:29:12,718 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:29:12,718 INFO L273 TraceCheckUtils]: 117: Hoare triple {11220#true} assume !(~i~0 < 10000); {11220#true} is VALID [2018-11-23 12:29:12,718 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:29:12,718 INFO L273 TraceCheckUtils]: 119: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:29:12,718 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {11220#true} {11221#false} #74#return; {11221#false} is VALID [2018-11-23 12:29:12,718 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:29:12,718 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:29:12,719 INFO L273 TraceCheckUtils]: 123: Hoare triple {11221#false} assume !false; {11221#false} is VALID [2018-11-23 12:29:12,734 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:29:12,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:12,734 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:29:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:13,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {11220#true} call ULTIMATE.init(); {11220#true} is VALID [2018-11-23 12:29:13,227 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:29:13,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {11220#true} assume true; {11220#true} is VALID [2018-11-23 12:29:13,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11220#true} {11220#true} #66#return; {11220#true} is VALID [2018-11-23 12:29:13,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {11220#true} call #t~ret13 := main(); {11220#true} is VALID [2018-11-23 12:29:13,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {11220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:13,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {11261#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:13,229 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:29:13,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {11223#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:13,230 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:29:13,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {11224#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:13,231 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:29:13,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {11225#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:13,233 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:29:13,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {11226#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:13,234 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:29:13,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {11227#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:13,236 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:29:13,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {11228#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:13,237 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:29:13,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {11229#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:13,239 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:29:13,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {11230#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:13,240 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:29:13,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {11231#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:13,242 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:29:13,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {11232#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:13,243 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:29:13,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {11233#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:13,245 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:29:13,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {11234#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:13,246 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:29:13,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {11235#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:13,248 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:29:13,248 INFO L273 TraceCheckUtils]: 34: Hoare triple {11236#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:13,249 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:29:13,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {11237#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:13,251 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:29:13,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {11238#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:13,252 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:29:13,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {11239#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:13,254 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:29:13,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {11240#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:13,255 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:29:13,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {11241#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:13,257 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:29:13,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {11242#(<= main_~i~1 20)} assume !(~i~1 < 10000); {11221#false} is VALID [2018-11-23 12:29:13,258 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:29:13,258 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:29:13,258 INFO L273 TraceCheckUtils]: 49: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,259 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:29:13,259 INFO L273 TraceCheckUtils]: 51: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,259 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:29:13,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,260 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:29:13,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,260 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:29:13,260 INFO L273 TraceCheckUtils]: 57: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,261 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:29:13,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,261 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:29:13,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,262 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:29:13,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {11221#false} assume !(~i~0 < 10000); {11221#false} is VALID [2018-11-23 12:29:13,262 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:29:13,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:29:13,262 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11221#false} {11221#false} #70#return; {11221#false} is VALID [2018-11-23 12:29:13,263 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:29:13,263 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:29:13,263 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:29:13,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,263 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:29:13,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,263 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:29:13,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,264 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:29:13,264 INFO L273 TraceCheckUtils]: 76: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,264 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:29:13,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,264 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:29:13,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,265 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:29:13,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,265 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:29:13,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {11221#false} assume !(~i~0 < 10000); {11221#false} is VALID [2018-11-23 12:29:13,265 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:29:13,265 INFO L273 TraceCheckUtils]: 86: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:29:13,266 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {11221#false} {11221#false} #72#return; {11221#false} is VALID [2018-11-23 12:29:13,266 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:29:13,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:13,266 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:29:13,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:13,266 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:29:13,266 INFO L273 TraceCheckUtils]: 93: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:13,267 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:29:13,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:13,267 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:29:13,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {11221#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:13,267 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:29:13,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {11221#false} assume !(~i~2 < 9999); {11221#false} is VALID [2018-11-23 12:29:13,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {11221#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11221#false} is VALID [2018-11-23 12:29:13,268 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:29:13,268 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:29:13,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,268 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:29:13,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,268 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:29:13,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,269 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:29:13,269 INFO L273 TraceCheckUtils]: 109: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,269 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:29:13,269 INFO L273 TraceCheckUtils]: 111: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,269 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:29:13,269 INFO L273 TraceCheckUtils]: 113: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,270 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:29:13,270 INFO L273 TraceCheckUtils]: 115: Hoare triple {11221#false} assume !!(~i~0 < 10000);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:29:13,270 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:29:13,270 INFO L273 TraceCheckUtils]: 117: Hoare triple {11221#false} assume !(~i~0 < 10000); {11221#false} is VALID [2018-11-23 12:29:13,270 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:29:13,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {11221#false} assume true; {11221#false} is VALID [2018-11-23 12:29:13,270 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {11221#false} {11221#false} #74#return; {11221#false} is VALID [2018-11-23 12:29:13,271 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:29:13,271 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:29:13,271 INFO L273 TraceCheckUtils]: 123: Hoare triple {11221#false} assume !false; {11221#false} is VALID [2018-11-23 12:29:13,286 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:29:13,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:29:13,306 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:29:13,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:13,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:29:13,419 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:29:13,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:29:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:29:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:13,420 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:29:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,006 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:29:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:29:14,006 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:29:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:29:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:29:14,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:29:14,114 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:29:14,116 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:29:14,116 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:29:14,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:29:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:29:14,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:14,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:14,167 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:14,168 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,171 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:29:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:29:14,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:14,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:14,171 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:29:14,171 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:29:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,174 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:29:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:29:14,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:14,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:14,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:14,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:29:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:29:14,177 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:29:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:14,178 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:29:14,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:29:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:29:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:29:14,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:14,179 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:29:14,180 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:14,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 20 times [2018-11-23 12:29:14,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:16,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {12120#true} call ULTIMATE.init(); {12120#true} is VALID [2018-11-23 12:29:16,004 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:29:16,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:29:16,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12120#true} {12120#true} #66#return; {12120#true} is VALID [2018-11-23 12:29:16,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {12120#true} call #t~ret13 := main(); {12120#true} is VALID [2018-11-23 12:29:16,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {12120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:16,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {12122#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:16,007 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:29:16,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:16,009 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:29:16,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {12124#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:16,010 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:29:16,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {12125#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:16,012 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:29:16,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:16,013 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:29:16,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:16,015 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:29:16,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:16,016 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:29:16,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {12129#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:16,018 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:29:16,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {12130#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:16,019 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:29:16,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {12131#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:16,021 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:29:16,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {12132#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:16,022 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:29:16,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {12133#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:16,024 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:29:16,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {12134#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:16,025 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:29:16,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {12135#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:16,027 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:29:16,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {12136#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:16,028 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:29:16,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {12137#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:16,030 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:29:16,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {12138#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:16,031 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:29:16,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {12139#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:16,033 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:29:16,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {12140#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:16,034 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:29:16,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {12141#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:16,036 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:29:16,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {12142#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:16,037 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:29:16,038 INFO L273 TraceCheckUtils]: 48: Hoare triple {12143#(<= main_~i~1 21)} assume !(~i~1 < 10000); {12121#false} is VALID [2018-11-23 12:29:16,038 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:29:16,039 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:29:16,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,039 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:29:16,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,040 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:29:16,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,040 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:29:16,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,041 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:29:16,041 INFO L273 TraceCheckUtils]: 59: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,041 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:29:16,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,042 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:29:16,042 INFO L273 TraceCheckUtils]: 63: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,042 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:29:16,042 INFO L273 TraceCheckUtils]: 65: Hoare triple {12120#true} assume !(~i~0 < 10000); {12120#true} is VALID [2018-11-23 12:29:16,043 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:29:16,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:29:16,043 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12120#true} {12121#false} #70#return; {12121#false} is VALID [2018-11-23 12:29:16,043 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:29:16,044 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:29:16,044 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:29:16,044 INFO L273 TraceCheckUtils]: 72: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,044 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:29:16,044 INFO L273 TraceCheckUtils]: 74: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,044 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:29:16,045 INFO L273 TraceCheckUtils]: 76: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,045 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:29:16,045 INFO L273 TraceCheckUtils]: 78: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,045 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:29:16,046 INFO L273 TraceCheckUtils]: 80: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,046 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:29:16,046 INFO L273 TraceCheckUtils]: 82: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,046 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:29:16,046 INFO L273 TraceCheckUtils]: 84: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,047 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:29:16,047 INFO L273 TraceCheckUtils]: 86: Hoare triple {12120#true} assume !(~i~0 < 10000); {12120#true} is VALID [2018-11-23 12:29:16,047 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:29:16,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:29:16,047 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12120#true} {12121#false} #72#return; {12121#false} is VALID [2018-11-23 12:29:16,048 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:29:16,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,048 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:29:16,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,049 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:29:16,049 INFO L273 TraceCheckUtils]: 95: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,049 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:29:16,049 INFO L273 TraceCheckUtils]: 97: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,049 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:29:16,050 INFO L273 TraceCheckUtils]: 99: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,050 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:29:16,050 INFO L273 TraceCheckUtils]: 101: Hoare triple {12121#false} assume !(~i~2 < 9999); {12121#false} is VALID [2018-11-23 12:29:16,050 INFO L273 TraceCheckUtils]: 102: Hoare triple {12121#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:29:16,050 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:29:16,051 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:29:16,051 INFO L273 TraceCheckUtils]: 105: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,051 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:29:16,051 INFO L273 TraceCheckUtils]: 107: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,052 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:29:16,052 INFO L273 TraceCheckUtils]: 109: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,052 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:29:16,052 INFO L273 TraceCheckUtils]: 111: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,052 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:29:16,053 INFO L273 TraceCheckUtils]: 113: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,053 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:29:16,053 INFO L273 TraceCheckUtils]: 115: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,053 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:29:16,053 INFO L273 TraceCheckUtils]: 117: Hoare triple {12120#true} assume !!(~i~0 < 10000);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:29:16,054 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:29:16,054 INFO L273 TraceCheckUtils]: 119: Hoare triple {12120#true} assume !(~i~0 < 10000); {12120#true} is VALID [2018-11-23 12:29:16,054 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:29:16,054 INFO L273 TraceCheckUtils]: 121: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:29:16,054 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12120#true} {12121#false} #74#return; {12121#false} is VALID [2018-11-23 12:29:16,055 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:29:16,055 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:29:16,055 INFO L273 TraceCheckUtils]: 125: Hoare triple {12121#false} assume !false; {12121#false} is VALID [2018-11-23 12:29:16,074 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:29:16,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:16,074 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:29:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:16,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:16,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:16,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:16,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {12120#true} call ULTIMATE.init(); {12120#true} is VALID [2018-11-23 12:29:16,475 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:29:16,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {12120#true} assume true; {12120#true} is VALID [2018-11-23 12:29:16,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12120#true} {12120#true} #66#return; {12120#true} is VALID [2018-11-23 12:29:16,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {12120#true} call #t~ret13 := main(); {12120#true} is VALID [2018-11-23 12:29:16,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {12120#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:16,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {12162#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:16,477 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:29:16,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:16,478 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:29:16,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {12124#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:16,479 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:29:16,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {12125#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:16,481 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:29:16,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:16,482 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:29:16,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:16,484 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:29:16,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:16,485 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:29:16,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {12129#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:16,487 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:29:16,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {12130#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:16,488 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:29:16,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {12131#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:16,490 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:29:16,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {12132#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:16,491 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:29:16,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {12133#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:16,493 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:29:16,493 INFO L273 TraceCheckUtils]: 30: Hoare triple {12134#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:16,494 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:29:16,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {12135#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:16,496 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:29:16,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {12136#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:16,497 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:29:16,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {12137#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:16,499 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:29:16,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {12138#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:16,500 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:29:16,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {12139#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:16,502 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:29:16,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {12140#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:16,503 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:29:16,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {12141#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:16,505 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:29:16,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {12142#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:16,506 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:29:16,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {12143#(<= main_~i~1 21)} assume !(~i~1 < 10000); {12121#false} is VALID [2018-11-23 12:29:16,507 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:29:16,508 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:29:16,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,508 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:29:16,508 INFO L273 TraceCheckUtils]: 53: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,509 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:29:16,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,509 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:29:16,509 INFO L273 TraceCheckUtils]: 57: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,510 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:29:16,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,510 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:29:16,510 INFO L273 TraceCheckUtils]: 61: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,511 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:29:16,511 INFO L273 TraceCheckUtils]: 63: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,511 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:29:16,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {12121#false} assume !(~i~0 < 10000); {12121#false} is VALID [2018-11-23 12:29:16,511 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:29:16,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:29:16,511 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12121#false} {12121#false} #70#return; {12121#false} is VALID [2018-11-23 12:29:16,512 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:29:16,512 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:29:16,512 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:29:16,512 INFO L273 TraceCheckUtils]: 72: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,512 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:29:16,536 INFO L273 TraceCheckUtils]: 74: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,536 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:29:16,536 INFO L273 TraceCheckUtils]: 76: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,536 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:29:16,536 INFO L273 TraceCheckUtils]: 78: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,537 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:29:16,537 INFO L273 TraceCheckUtils]: 80: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,537 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:29:16,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,537 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:29:16,537 INFO L273 TraceCheckUtils]: 84: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,538 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:29:16,538 INFO L273 TraceCheckUtils]: 86: Hoare triple {12121#false} assume !(~i~0 < 10000); {12121#false} is VALID [2018-11-23 12:29:16,538 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:29:16,538 INFO L273 TraceCheckUtils]: 88: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:29:16,538 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12121#false} {12121#false} #72#return; {12121#false} is VALID [2018-11-23 12:29:16,539 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:29:16,539 INFO L273 TraceCheckUtils]: 91: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,539 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:29:16,539 INFO L273 TraceCheckUtils]: 93: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,539 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:29:16,540 INFO L273 TraceCheckUtils]: 95: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,540 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:29:16,540 INFO L273 TraceCheckUtils]: 97: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,540 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:29:16,540 INFO L273 TraceCheckUtils]: 99: Hoare triple {12121#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:16,540 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:29:16,541 INFO L273 TraceCheckUtils]: 101: Hoare triple {12121#false} assume !(~i~2 < 9999); {12121#false} is VALID [2018-11-23 12:29:16,541 INFO L273 TraceCheckUtils]: 102: Hoare triple {12121#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12121#false} is VALID [2018-11-23 12:29:16,541 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:29:16,541 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:29:16,541 INFO L273 TraceCheckUtils]: 105: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,541 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:29:16,541 INFO L273 TraceCheckUtils]: 107: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,541 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:29:16,541 INFO L273 TraceCheckUtils]: 109: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,542 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:29:16,542 INFO L273 TraceCheckUtils]: 111: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,542 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:29:16,542 INFO L273 TraceCheckUtils]: 113: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,542 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:29:16,542 INFO L273 TraceCheckUtils]: 115: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,542 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:29:16,542 INFO L273 TraceCheckUtils]: 117: Hoare triple {12121#false} assume !!(~i~0 < 10000);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:29:16,542 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:29:16,543 INFO L273 TraceCheckUtils]: 119: Hoare triple {12121#false} assume !(~i~0 < 10000); {12121#false} is VALID [2018-11-23 12:29:16,543 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:29:16,543 INFO L273 TraceCheckUtils]: 121: Hoare triple {12121#false} assume true; {12121#false} is VALID [2018-11-23 12:29:16,543 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12121#false} {12121#false} #74#return; {12121#false} is VALID [2018-11-23 12:29:16,543 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:29:16,543 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:29:16,543 INFO L273 TraceCheckUtils]: 125: Hoare triple {12121#false} assume !false; {12121#false} is VALID [2018-11-23 12:29:16,551 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:29:16,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:16,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:29:16,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:29:16,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:16,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:29:16,704 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:29:16,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:29:16,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:29:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:29:16,705 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2018-11-23 12:29:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:17,440 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-11-23 12:29:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:29:17,440 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:29:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:29:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-23 12:29:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:29:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-23 12:29:17,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 96 transitions. [2018-11-23 12:29:17,536 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:29:17,539 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:29:17,539 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:29:17,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:29:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:29:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 12:29:17,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:17,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 12:29:17,582 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 12:29:17,582 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 12:29:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:17,584 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:29:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:29:17,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:17,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:17,586 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 12:29:17,586 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 12:29:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:17,588 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:29:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:29:17,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:17,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:17,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:17,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:29:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-23 12:29:17,591 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 126 [2018-11-23 12:29:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:17,591 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-23 12:29:17,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:29:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 12:29:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:29:17,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:17,593 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:29:17,593 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:17,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -140564161, now seen corresponding path program 21 times [2018-11-23 12:29:17,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:17,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {13037#true} call ULTIMATE.init(); {13037#true} is VALID [2018-11-23 12:29:17,989 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:29:17,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:17,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13037#true} {13037#true} #66#return; {13037#true} is VALID [2018-11-23 12:29:17,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {13037#true} call #t~ret13 := main(); {13037#true} is VALID [2018-11-23 12:29:17,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {13037#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:17,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {13039#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:17,991 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:29:17,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {13040#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:17,992 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:29:17,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {13041#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:17,993 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:29:17,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {13042#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:17,994 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:29:17,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {13043#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:17,995 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:29:17,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {13044#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:17,996 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:29:17,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {13045#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:17,997 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:29:17,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {13046#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:17,998 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:29:17,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {13047#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:18,000 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:29:18,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:18,001 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:29:18,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:18,002 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:29:18,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {13050#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:18,003 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:29:18,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {13051#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:18,005 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:29:18,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {13052#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:18,006 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:29:18,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {13053#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:18,024 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:29:18,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {13054#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:18,052 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:29:18,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {13055#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:18,074 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:29:18,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {13056#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:18,097 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:29:18,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {13057#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:18,120 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:29:18,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {13058#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:18,147 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:29:18,156 INFO L273 TraceCheckUtils]: 46: Hoare triple {13059#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:18,169 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:29:18,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {13060#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:18,196 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:29:18,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {13061#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13038#false} is VALID [2018-11-23 12:29:18,210 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:29:18,210 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:29:18,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,211 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:29:18,211 INFO L273 TraceCheckUtils]: 55: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,211 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:29:18,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,211 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:29:18,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,212 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:29:18,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,212 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:29:18,212 INFO L273 TraceCheckUtils]: 63: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,212 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:29:18,213 INFO L273 TraceCheckUtils]: 65: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,213 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:29:18,213 INFO L273 TraceCheckUtils]: 67: Hoare triple {13037#true} assume !(~i~0 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,213 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:29:18,213 INFO L273 TraceCheckUtils]: 69: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,213 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13037#true} {13038#false} #70#return; {13038#false} is VALID [2018-11-23 12:29:18,213 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:29:18,214 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:29:18,214 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:29:18,214 INFO L273 TraceCheckUtils]: 74: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,214 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:29:18,214 INFO L273 TraceCheckUtils]: 76: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,214 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:29:18,215 INFO L273 TraceCheckUtils]: 78: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,215 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:29:18,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,215 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:29:18,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,216 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:29:18,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,216 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:29:18,216 INFO L273 TraceCheckUtils]: 86: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,216 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:29:18,216 INFO L273 TraceCheckUtils]: 88: Hoare triple {13037#true} assume !(~i~0 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,216 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:29:18,217 INFO L273 TraceCheckUtils]: 90: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,217 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13037#true} {13038#false} #72#return; {13038#false} is VALID [2018-11-23 12:29:18,217 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:29:18,217 INFO L273 TraceCheckUtils]: 93: Hoare triple {13038#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,217 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:29:18,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {13038#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,218 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:29:18,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {13038#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,218 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:29:18,218 INFO L273 TraceCheckUtils]: 99: Hoare triple {13038#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,218 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:29:18,218 INFO L273 TraceCheckUtils]: 101: Hoare triple {13038#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,219 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:29:18,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {13038#false} assume !(~i~2 < 9999); {13038#false} is VALID [2018-11-23 12:29:18,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {13038#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13038#false} is VALID [2018-11-23 12:29:18,219 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:29:18,219 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:29:18,219 INFO L273 TraceCheckUtils]: 107: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,219 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:29:18,220 INFO L273 TraceCheckUtils]: 109: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,220 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:29:18,220 INFO L273 TraceCheckUtils]: 111: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,220 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:29:18,220 INFO L273 TraceCheckUtils]: 113: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,220 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:29:18,221 INFO L273 TraceCheckUtils]: 115: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,221 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:29:18,221 INFO L273 TraceCheckUtils]: 117: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,221 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:29:18,221 INFO L273 TraceCheckUtils]: 119: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,221 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:29:18,222 INFO L273 TraceCheckUtils]: 121: Hoare triple {13037#true} assume !(~i~0 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,222 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:29:18,222 INFO L273 TraceCheckUtils]: 123: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,222 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {13037#true} {13038#false} #74#return; {13038#false} is VALID [2018-11-23 12:29:18,222 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:29:18,222 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:29:18,223 INFO L273 TraceCheckUtils]: 127: Hoare triple {13038#false} assume !false; {13038#false} is VALID [2018-11-23 12:29:18,234 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:29:18,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:18,235 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:29:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:18,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:29:18,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:18,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:18,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {13037#true} call ULTIMATE.init(); {13037#true} is VALID [2018-11-23 12:29:18,709 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:29:18,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13037#true} {13037#true} #66#return; {13037#true} is VALID [2018-11-23 12:29:18,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {13037#true} call #t~ret13 := main(); {13037#true} is VALID [2018-11-23 12:29:18,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {13037#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13037#true} is VALID [2018-11-23 12:29:18,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,710 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:29:18,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,711 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:29:18,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,711 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:29:18,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,711 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:29:18,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,711 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:29:18,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,712 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:29:18,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,712 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:29:18,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,712 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:29:18,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,713 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:29:18,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,713 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:29:18,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,713 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:29:18,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,713 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:29:18,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,714 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:29:18,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,714 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:29:18,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,714 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:29:18,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,715 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:29:18,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,715 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:29:18,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,715 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:29:18,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,715 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:29:18,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,716 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:29:18,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,716 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:29:18,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {13037#true} assume !!(~i~1 < 10000);assume -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:29:18,716 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:29:18,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {13037#true} assume !(~i~1 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,716 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:29:18,716 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:29:18,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,717 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:29:18,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,717 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:29:18,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,717 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:29:18,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,717 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:29:18,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,717 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:29:18,718 INFO L273 TraceCheckUtils]: 63: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,718 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:29:18,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,718 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:29:18,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {13037#true} assume !(~i~0 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,718 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:29:18,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,718 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13037#true} {13037#true} #70#return; {13037#true} is VALID [2018-11-23 12:29:18,718 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:29:18,719 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:29:18,719 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:29:18,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,719 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:29:18,719 INFO L273 TraceCheckUtils]: 76: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,719 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:29:18,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,719 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:29:18,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,720 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:29:18,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,720 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:29:18,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,720 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:29:18,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {13037#true} assume !!(~i~0 < 10000);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:29:18,720 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:29:18,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {13037#true} assume !(~i~0 < 10000); {13037#true} is VALID [2018-11-23 12:29:18,720 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:29:18,721 INFO L273 TraceCheckUtils]: 90: Hoare triple {13037#true} assume true; {13037#true} is VALID [2018-11-23 12:29:18,721 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13037#true} {13037#true} #72#return; {13037#true} is VALID [2018-11-23 12:29:18,721 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:29:18,722 INFO L273 TraceCheckUtils]: 93: Hoare triple {13341#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,722 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:29:18,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {13348#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,723 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:29:18,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {13355#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,724 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:29:18,724 INFO L273 TraceCheckUtils]: 99: Hoare triple {13362#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,725 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:29:18,726 INFO L273 TraceCheckUtils]: 101: Hoare triple {13369#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:18,726 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:29:18,727 INFO L273 TraceCheckUtils]: 103: Hoare triple {13376#(<= main_~i~2 5)} assume !(~i~2 < 9999); {13038#false} is VALID [2018-11-23 12:29:18,727 INFO L273 TraceCheckUtils]: 104: Hoare triple {13038#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13038#false} is VALID [2018-11-23 12:29:18,727 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:29:18,728 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:29:18,728 INFO L273 TraceCheckUtils]: 107: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,728 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:29:18,728 INFO L273 TraceCheckUtils]: 109: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,728 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:29:18,729 INFO L273 TraceCheckUtils]: 111: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,729 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:29:18,729 INFO L273 TraceCheckUtils]: 113: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,729 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:29:18,729 INFO L273 TraceCheckUtils]: 115: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,730 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:29:18,730 INFO L273 TraceCheckUtils]: 117: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,730 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:29:18,730 INFO L273 TraceCheckUtils]: 119: Hoare triple {13038#false} assume !!(~i~0 < 10000);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:29:18,730 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:29:18,730 INFO L273 TraceCheckUtils]: 121: Hoare triple {13038#false} assume !(~i~0 < 10000); {13038#false} is VALID [2018-11-23 12:29:18,731 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:29:18,731 INFO L273 TraceCheckUtils]: 123: Hoare triple {13038#false} assume true; {13038#false} is VALID [2018-11-23 12:29:18,731 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {13038#false} {13038#false} #74#return; {13038#false} is VALID [2018-11-23 12:29:18,732 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:29:18,732 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:29:18,732 INFO L273 TraceCheckUtils]: 127: Hoare triple {13038#false} assume !false; {13038#false} is VALID [2018-11-23 12:29:18,739 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:29:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:18,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2018-11-23 12:29:18,759 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-11-23 12:29:18,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:18,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:29:18,860 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:29:18,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:29:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:29:18,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:29:18,861 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 31 states. [2018-11-23 12:29:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,318 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-11-23 12:29:19,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:29:19,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-11-23 12:29:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:29:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2018-11-23 12:29:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:29:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2018-11-23 12:29:19,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 111 transitions. [2018-11-23 12:29:19,504 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:29:19,506 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:29:19,506 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:29:19,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:29:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:29:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-23 12:29:19,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:19,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 95 states. [2018-11-23 12:29:19,978 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 95 states. [2018-11-23 12:29:19,978 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 95 states. [2018-11-23 12:29:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,980 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:29:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:29:19,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,982 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 97 states. [2018-11-23 12:29:19,982 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 97 states. [2018-11-23 12:29:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,985 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:29:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:29:19,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:19,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:29:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:29:19,988 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 128 [2018-11-23 12:29:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:19,988 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:29:19,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:29:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:29:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:29:19,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:19,990 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:29:19,990 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:19,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 22 times [2018-11-23 12:29:19,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:19,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:19,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:21,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {13989#true} call ULTIMATE.init(); {13989#true} is VALID [2018-11-23 12:29:21,290 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:29:21,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:29:21,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13989#true} {13989#true} #66#return; {13989#true} is VALID [2018-11-23 12:29:21,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {13989#true} call #t~ret13 := main(); {13989#true} is VALID [2018-11-23 12:29:21,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {13989#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:21,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {13991#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:21,292 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:29:21,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {13992#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:21,293 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:29:21,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {13993#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:21,294 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:29:21,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {13994#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:21,295 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:29:21,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {13995#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:21,296 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:29:21,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:21,297 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:29:21,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {13997#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:21,299 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:29:21,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {13998#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:21,300 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:29:21,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {13999#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:21,302 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:29:21,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {14000#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:21,304 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:29:21,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {14001#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:21,305 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:29:21,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:21,306 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:29:21,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:21,307 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:29:21,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {14004#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:21,309 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:29:21,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {14005#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:21,310 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:29:21,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {14006#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:21,311 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:29:21,312 INFO L273 TraceCheckUtils]: 38: Hoare triple {14007#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:21,312 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:29:21,313 INFO L273 TraceCheckUtils]: 40: Hoare triple {14008#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:21,314 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:29:21,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {14009#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:21,315 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:29:21,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {14010#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:21,316 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:29:21,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {14011#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:21,318 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:29:21,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {14012#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:21,319 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:29:21,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {14013#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:21,320 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:29:21,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {14014#(<= main_~i~1 23)} assume !(~i~1 < 10000); {13990#false} is VALID [2018-11-23 12:29:21,321 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:29:21,321 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:29:21,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,322 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:29:21,322 INFO L273 TraceCheckUtils]: 57: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,322 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:29:21,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,322 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:29:21,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,323 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:29:21,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,323 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:29:21,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,323 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:29:21,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,324 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:29:21,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {13989#true} assume !(~i~0 < 10000); {13989#true} is VALID [2018-11-23 12:29:21,324 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:29:21,324 INFO L273 TraceCheckUtils]: 71: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:29:21,324 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13989#true} {13990#false} #70#return; {13990#false} is VALID [2018-11-23 12:29:21,324 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:29:21,324 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:29:21,324 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:29:21,324 INFO L273 TraceCheckUtils]: 76: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,325 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:29:21,325 INFO L273 TraceCheckUtils]: 78: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,325 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:29:21,325 INFO L273 TraceCheckUtils]: 80: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,325 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:29:21,325 INFO L273 TraceCheckUtils]: 82: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,325 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:29:21,325 INFO L273 TraceCheckUtils]: 84: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,325 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:29:21,326 INFO L273 TraceCheckUtils]: 86: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,326 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:29:21,326 INFO L273 TraceCheckUtils]: 88: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,326 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:29:21,326 INFO L273 TraceCheckUtils]: 90: Hoare triple {13989#true} assume !(~i~0 < 10000); {13989#true} is VALID [2018-11-23 12:29:21,326 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:29:21,326 INFO L273 TraceCheckUtils]: 92: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:29:21,326 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {13989#true} {13990#false} #72#return; {13990#false} is VALID [2018-11-23 12:29:21,326 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:29:21,327 INFO L273 TraceCheckUtils]: 95: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,327 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:29:21,327 INFO L273 TraceCheckUtils]: 97: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,327 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:29:21,327 INFO L273 TraceCheckUtils]: 99: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,327 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:29:21,327 INFO L273 TraceCheckUtils]: 101: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,327 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:29:21,327 INFO L273 TraceCheckUtils]: 103: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,328 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:29:21,328 INFO L273 TraceCheckUtils]: 105: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,328 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:29:21,328 INFO L273 TraceCheckUtils]: 107: Hoare triple {13990#false} assume !(~i~2 < 9999); {13990#false} is VALID [2018-11-23 12:29:21,328 INFO L273 TraceCheckUtils]: 108: Hoare triple {13990#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:29:21,328 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:29:21,328 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:29:21,328 INFO L273 TraceCheckUtils]: 111: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,328 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:29:21,329 INFO L273 TraceCheckUtils]: 113: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,329 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:29:21,329 INFO L273 TraceCheckUtils]: 115: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,329 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:29:21,329 INFO L273 TraceCheckUtils]: 117: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,329 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:29:21,329 INFO L273 TraceCheckUtils]: 119: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,329 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:29:21,329 INFO L273 TraceCheckUtils]: 121: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,330 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:29:21,330 INFO L273 TraceCheckUtils]: 123: Hoare triple {13989#true} assume !!(~i~0 < 10000);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:29:21,330 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:29:21,330 INFO L273 TraceCheckUtils]: 125: Hoare triple {13989#true} assume !(~i~0 < 10000); {13989#true} is VALID [2018-11-23 12:29:21,330 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:29:21,330 INFO L273 TraceCheckUtils]: 127: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:29:21,330 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {13989#true} {13990#false} #74#return; {13990#false} is VALID [2018-11-23 12:29:21,330 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:29:21,330 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:29:21,331 INFO L273 TraceCheckUtils]: 131: Hoare triple {13990#false} assume !false; {13990#false} is VALID [2018-11-23 12:29:21,340 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:29:21,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:21,340 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:29:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:21,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:21,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:21,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:21,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {13989#true} call ULTIMATE.init(); {13989#true} is VALID [2018-11-23 12:29:21,820 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:29:21,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {13989#true} assume true; {13989#true} is VALID [2018-11-23 12:29:21,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13989#true} {13989#true} #66#return; {13989#true} is VALID [2018-11-23 12:29:21,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {13989#true} call #t~ret13 := main(); {13989#true} is VALID [2018-11-23 12:29:21,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {13989#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:21,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {14033#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:21,823 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:29:21,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {13992#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:21,824 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:29:21,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {13993#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:21,824 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:29:21,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {13994#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:21,825 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:29:21,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {13995#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:21,826 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:29:21,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:21,828 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:29:21,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {13997#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:21,829 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:29:21,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {13998#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:21,830 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:29:21,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {13999#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:21,831 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:29:21,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {14000#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:21,833 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:29:21,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {14001#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:21,834 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:29:21,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:21,835 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:29:21,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:21,836 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:29:21,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {14004#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:21,838 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:29:21,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {14005#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:21,839 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:29:21,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {14006#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:21,840 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:29:21,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {14007#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:21,841 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:29:21,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {14008#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:21,843 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:29:21,843 INFO L273 TraceCheckUtils]: 42: Hoare triple {14009#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:21,844 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:29:21,844 INFO L273 TraceCheckUtils]: 44: Hoare triple {14010#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:21,845 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:29:21,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {14011#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:21,846 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:29:21,847 INFO L273 TraceCheckUtils]: 48: Hoare triple {14012#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:21,848 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:29:21,848 INFO L273 TraceCheckUtils]: 50: Hoare triple {14013#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:21,849 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:29:21,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {14014#(<= main_~i~1 23)} assume !(~i~1 < 10000); {13990#false} is VALID [2018-11-23 12:29:21,850 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:29:21,850 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:29:21,850 INFO L273 TraceCheckUtils]: 55: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,850 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:29:21,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,851 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:29:21,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,851 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:29:21,851 INFO L273 TraceCheckUtils]: 61: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,852 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:29:21,852 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,852 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:29:21,852 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,852 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:29:21,852 INFO L273 TraceCheckUtils]: 67: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,853 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:29:21,853 INFO L273 TraceCheckUtils]: 69: Hoare triple {13990#false} assume !(~i~0 < 10000); {13990#false} is VALID [2018-11-23 12:29:21,853 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:29:21,853 INFO L273 TraceCheckUtils]: 71: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:29:21,853 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13990#false} {13990#false} #70#return; {13990#false} is VALID [2018-11-23 12:29:21,854 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:29:21,854 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:29:21,854 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:29:21,854 INFO L273 TraceCheckUtils]: 76: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,854 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:29:21,854 INFO L273 TraceCheckUtils]: 78: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,854 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:29:21,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,854 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:29:21,854 INFO L273 TraceCheckUtils]: 82: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,855 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:29:21,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,855 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:29:21,855 INFO L273 TraceCheckUtils]: 86: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,855 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:29:21,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,855 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:29:21,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {13990#false} assume !(~i~0 < 10000); {13990#false} is VALID [2018-11-23 12:29:21,855 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:29:21,856 INFO L273 TraceCheckUtils]: 92: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:29:21,856 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {13990#false} {13990#false} #72#return; {13990#false} is VALID [2018-11-23 12:29:21,856 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:29:21,856 INFO L273 TraceCheckUtils]: 95: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,856 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:29:21,856 INFO L273 TraceCheckUtils]: 97: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,856 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:29:21,856 INFO L273 TraceCheckUtils]: 99: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,856 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:29:21,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,857 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:29:21,857 INFO L273 TraceCheckUtils]: 103: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,857 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:29:21,857 INFO L273 TraceCheckUtils]: 105: Hoare triple {13990#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:21,857 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:29:21,857 INFO L273 TraceCheckUtils]: 107: Hoare triple {13990#false} assume !(~i~2 < 9999); {13990#false} is VALID [2018-11-23 12:29:21,857 INFO L273 TraceCheckUtils]: 108: Hoare triple {13990#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13990#false} is VALID [2018-11-23 12:29:21,857 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:29:21,858 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:29:21,858 INFO L273 TraceCheckUtils]: 111: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,858 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:29:21,858 INFO L273 TraceCheckUtils]: 113: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,858 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:29:21,858 INFO L273 TraceCheckUtils]: 115: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,858 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:29:21,858 INFO L273 TraceCheckUtils]: 117: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,858 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:29:21,858 INFO L273 TraceCheckUtils]: 119: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,859 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:29:21,859 INFO L273 TraceCheckUtils]: 121: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,859 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:29:21,859 INFO L273 TraceCheckUtils]: 123: Hoare triple {13990#false} assume !!(~i~0 < 10000);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:29:21,859 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:29:21,859 INFO L273 TraceCheckUtils]: 125: Hoare triple {13990#false} assume !(~i~0 < 10000); {13990#false} is VALID [2018-11-23 12:29:21,859 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:29:21,859 INFO L273 TraceCheckUtils]: 127: Hoare triple {13990#false} assume true; {13990#false} is VALID [2018-11-23 12:29:21,859 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {13990#false} {13990#false} #74#return; {13990#false} is VALID [2018-11-23 12:29:21,860 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:29:21,860 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:29:21,860 INFO L273 TraceCheckUtils]: 131: Hoare triple {13990#false} assume !false; {13990#false} is VALID [2018-11-23 12:29:21,868 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:29:21,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:21,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:29:21,887 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2018-11-23 12:29:21,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:21,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:29:21,980 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:29:21,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:29:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:29:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:29:21,982 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 27 states. [2018-11-23 12:29:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,008 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 12:29:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:29:23,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2018-11-23 12:29:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 100 transitions. [2018-11-23 12:29:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 100 transitions. [2018-11-23 12:29:23,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 100 transitions. [2018-11-23 12:29:23,109 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:29:23,112 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:29:23,112 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:29:23,113 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:29:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:29:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 12:29:23,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:23,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states. [2018-11-23 12:29:23,162 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states. [2018-11-23 12:29:23,162 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 97 states. [2018-11-23 12:29:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,165 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-23 12:29:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 12:29:23,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:23,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:23,166 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states. [2018-11-23 12:29:23,166 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 98 states. [2018-11-23 12:29:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,168 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-23 12:29:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 12:29:23,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:23,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:23,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:23,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:29:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-11-23 12:29:23,171 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 132 [2018-11-23 12:29:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:23,171 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-11-23 12:29:23,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:29:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:29:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 12:29:23,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:23,172 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:29:23,173 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:23,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -807181567, now seen corresponding path program 23 times [2018-11-23 12:29:23,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:23,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:24,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {14959#true} call ULTIMATE.init(); {14959#true} is VALID [2018-11-23 12:29:24,322 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:29:24,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:29:24,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14959#true} {14959#true} #66#return; {14959#true} is VALID [2018-11-23 12:29:24,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {14959#true} call #t~ret13 := main(); {14959#true} is VALID [2018-11-23 12:29:24,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {14959#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:24,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {14961#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:24,325 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:29:24,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {14962#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:24,326 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:29:24,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {14963#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:24,327 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:29:24,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {14964#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:24,328 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:29:24,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {14965#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:24,329 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:29:24,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {14966#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:24,330 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:29:24,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {14967#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:24,332 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:29:24,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {14968#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:24,333 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:29:24,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {14969#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:24,334 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:29:24,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {14970#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:24,335 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:29:24,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {14971#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:24,337 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:29:24,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {14972#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:24,338 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:29:24,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {14973#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:24,339 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:29:24,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {14974#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:24,340 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:29:24,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {14975#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:24,342 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:29:24,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {14976#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:24,343 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:29:24,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {14977#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:24,344 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:29:24,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {14978#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:24,345 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:29:24,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {14979#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:24,347 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:29:24,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {14980#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:24,348 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:29:24,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {14981#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:24,349 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:29:24,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {14982#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:24,350 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:29:24,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {14983#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:24,352 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:29:24,352 INFO L273 TraceCheckUtils]: 52: Hoare triple {14984#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:24,353 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:29:24,354 INFO L273 TraceCheckUtils]: 54: Hoare triple {14985#(<= main_~i~1 24)} assume !(~i~1 < 10000); {14960#false} is VALID [2018-11-23 12:29:24,354 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:29:24,354 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:29:24,354 INFO L273 TraceCheckUtils]: 57: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,354 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:29:24,355 INFO L273 TraceCheckUtils]: 59: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,355 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:29:24,355 INFO L273 TraceCheckUtils]: 61: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,355 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:29:24,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,356 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:29:24,356 INFO L273 TraceCheckUtils]: 65: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,356 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:29:24,356 INFO L273 TraceCheckUtils]: 67: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,356 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:29:24,357 INFO L273 TraceCheckUtils]: 69: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,357 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:29:24,357 INFO L273 TraceCheckUtils]: 71: Hoare triple {14959#true} assume !(~i~0 < 10000); {14959#true} is VALID [2018-11-23 12:29:24,357 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:29:24,357 INFO L273 TraceCheckUtils]: 73: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:29:24,357 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {14959#true} {14960#false} #70#return; {14960#false} is VALID [2018-11-23 12:29:24,358 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:29:24,358 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:29:24,358 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:29:24,358 INFO L273 TraceCheckUtils]: 78: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,358 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:29:24,358 INFO L273 TraceCheckUtils]: 80: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,359 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:29:24,359 INFO L273 TraceCheckUtils]: 82: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,359 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:29:24,359 INFO L273 TraceCheckUtils]: 84: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,359 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:29:24,359 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,359 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:29:24,359 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,359 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:29:24,359 INFO L273 TraceCheckUtils]: 90: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,360 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:29:24,360 INFO L273 TraceCheckUtils]: 92: Hoare triple {14959#true} assume !(~i~0 < 10000); {14959#true} is VALID [2018-11-23 12:29:24,360 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:29:24,360 INFO L273 TraceCheckUtils]: 94: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:29:24,360 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14959#true} {14960#false} #72#return; {14960#false} is VALID [2018-11-23 12:29:24,360 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:29:24,360 INFO L273 TraceCheckUtils]: 97: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,360 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:29:24,360 INFO L273 TraceCheckUtils]: 99: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,361 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:29:24,361 INFO L273 TraceCheckUtils]: 101: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,361 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:29:24,361 INFO L273 TraceCheckUtils]: 103: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,361 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:29:24,361 INFO L273 TraceCheckUtils]: 105: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,361 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:29:24,361 INFO L273 TraceCheckUtils]: 107: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:24,361 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:29:24,362 INFO L273 TraceCheckUtils]: 109: Hoare triple {14960#false} assume !(~i~2 < 9999); {14960#false} is VALID [2018-11-23 12:29:24,362 INFO L273 TraceCheckUtils]: 110: Hoare triple {14960#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:29:24,362 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:29:24,362 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:29:24,362 INFO L273 TraceCheckUtils]: 113: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,362 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:29:24,362 INFO L273 TraceCheckUtils]: 115: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,362 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:29:24,362 INFO L273 TraceCheckUtils]: 117: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,363 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:29:24,363 INFO L273 TraceCheckUtils]: 119: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,363 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:29:24,363 INFO L273 TraceCheckUtils]: 121: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,363 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:29:24,363 INFO L273 TraceCheckUtils]: 123: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,363 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:29:24,363 INFO L273 TraceCheckUtils]: 125: Hoare triple {14959#true} assume !!(~i~0 < 10000);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:29:24,363 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:29:24,363 INFO L273 TraceCheckUtils]: 127: Hoare triple {14959#true} assume !(~i~0 < 10000); {14959#true} is VALID [2018-11-23 12:29:24,364 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:29:24,364 INFO L273 TraceCheckUtils]: 129: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:29:24,364 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {14959#true} {14960#false} #74#return; {14960#false} is VALID [2018-11-23 12:29:24,364 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:29:24,364 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:29:24,364 INFO L273 TraceCheckUtils]: 133: Hoare triple {14960#false} assume !false; {14960#false} is VALID [2018-11-23 12:29:24,372 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:29:24,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:24,373 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:29:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:29,014 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:29:29,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:29,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:29,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {14959#true} call ULTIMATE.init(); {14959#true} is VALID [2018-11-23 12:29:29,328 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:29:29,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {14959#true} assume true; {14959#true} is VALID [2018-11-23 12:29:29,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14959#true} {14959#true} #66#return; {14959#true} is VALID [2018-11-23 12:29:29,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {14959#true} call #t~ret13 := main(); {14959#true} is VALID [2018-11-23 12:29:29,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {14959#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14959#true} is VALID [2018-11-23 12:29:29,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,330 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:29:29,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,330 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:29:29,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,330 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:29:29,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,331 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:29:29,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,331 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:29:29,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,331 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:29:29,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,331 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:29:29,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,331 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:29:29,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,332 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:29:29,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,332 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:29:29,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,332 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:29:29,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,332 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:29:29,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,333 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:29:29,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,333 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:29:29,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,333 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:29:29,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,333 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:29:29,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,333 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:29:29,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,334 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:29:29,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,334 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:29:29,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,334 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:29:29,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,334 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:29:29,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,335 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:29:29,335 INFO L273 TraceCheckUtils]: 50: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,335 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:29:29,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {14959#true} assume !!(~i~1 < 10000);assume -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:29:29,335 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:29:29,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {14959#true} assume !(~i~1 < 10000); {14959#true} is VALID [2018-11-23 12:29:29,335 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:29:29,336 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:29:29,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {15157#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:29:29,337 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:29:29,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {15164#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:29:29,337 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:29:29,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {15171#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:29:29,339 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:29:29,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {15178#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:29:29,340 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:29:29,340 INFO L273 TraceCheckUtils]: 65: Hoare triple {15185#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:29:29,341 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:29:29,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {15192#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:29:29,342 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:29:29,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {15199#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:29:29,344 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:29:29,344 INFO L273 TraceCheckUtils]: 71: Hoare triple {15206#(<= xor_~i~0 8)} assume !(~i~0 < 10000); {14960#false} is VALID [2018-11-23 12:29:29,344 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:29:29,345 INFO L273 TraceCheckUtils]: 73: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:29:29,345 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {14960#false} {14959#true} #70#return; {14960#false} is VALID [2018-11-23 12:29:29,345 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:29:29,345 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:29:29,345 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:29:29,346 INFO L273 TraceCheckUtils]: 78: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,346 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:29:29,346 INFO L273 TraceCheckUtils]: 80: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,346 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:29:29,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,346 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:29:29,347 INFO L273 TraceCheckUtils]: 84: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,347 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:29:29,347 INFO L273 TraceCheckUtils]: 86: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,347 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:29:29,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,348 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:29:29,348 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,348 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:29:29,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#false} assume !(~i~0 < 10000); {14960#false} is VALID [2018-11-23 12:29:29,348 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:29:29,349 INFO L273 TraceCheckUtils]: 94: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:29:29,349 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {14960#false} {14960#false} #72#return; {14960#false} is VALID [2018-11-23 12:29:29,349 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:29:29,349 INFO L273 TraceCheckUtils]: 97: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,349 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:29:29,349 INFO L273 TraceCheckUtils]: 99: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,350 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:29:29,350 INFO L273 TraceCheckUtils]: 101: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,350 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:29:29,350 INFO L273 TraceCheckUtils]: 103: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,350 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:29:29,350 INFO L273 TraceCheckUtils]: 105: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,350 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:29:29,350 INFO L273 TraceCheckUtils]: 107: Hoare triple {14960#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:29,350 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:29:29,351 INFO L273 TraceCheckUtils]: 109: Hoare triple {14960#false} assume !(~i~2 < 9999); {14960#false} is VALID [2018-11-23 12:29:29,351 INFO L273 TraceCheckUtils]: 110: Hoare triple {14960#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14960#false} is VALID [2018-11-23 12:29:29,351 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:29:29,351 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:29:29,351 INFO L273 TraceCheckUtils]: 113: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,351 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:29:29,351 INFO L273 TraceCheckUtils]: 115: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,351 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:29:29,351 INFO L273 TraceCheckUtils]: 117: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,352 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:29:29,352 INFO L273 TraceCheckUtils]: 119: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,352 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:29:29,352 INFO L273 TraceCheckUtils]: 121: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,352 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:29:29,352 INFO L273 TraceCheckUtils]: 123: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,352 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:29:29,352 INFO L273 TraceCheckUtils]: 125: Hoare triple {14960#false} assume !!(~i~0 < 10000);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:29:29,352 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:29:29,353 INFO L273 TraceCheckUtils]: 127: Hoare triple {14960#false} assume !(~i~0 < 10000); {14960#false} is VALID [2018-11-23 12:29:29,353 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:29:29,353 INFO L273 TraceCheckUtils]: 129: Hoare triple {14960#false} assume true; {14960#false} is VALID [2018-11-23 12:29:29,353 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {14960#false} {14960#false} #74#return; {14960#false} is VALID [2018-11-23 12:29:29,353 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:29:29,353 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:29:29,353 INFO L273 TraceCheckUtils]: 133: Hoare triple {14960#false} assume !false; {14960#false} is VALID [2018-11-23 12:29:29,360 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:29:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-23 12:29:29,382 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-11-23 12:29:29,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:29,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:29:29,487 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:29:29,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:29:29,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:29:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:29:29,488 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 35 states. [2018-11-23 12:29:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:30,339 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-11-23 12:29:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:29:30,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-11-23 12:29:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:29:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:29:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:29:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:29:30,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2018-11-23 12:29:30,574 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:29:30,576 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:29:30,576 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:29:30,577 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:29:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:29:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-23 12:29:30,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:30,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-23 12:29:30,669 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-23 12:29:30,669 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-23 12:29:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:30,671 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:29:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:29:30,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:30,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:30,672 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-23 12:29:30,672 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-23 12:29:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:30,673 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 12:29:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:29:30,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:30,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:30,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:30,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:29:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-23 12:29:30,676 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 134 [2018-11-23 12:29:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:30,676 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-23 12:29:30,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:29:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:29:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:29:30,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:30,677 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:29:30,677 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:30,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1827973695, now seen corresponding path program 24 times [2018-11-23 12:29:30,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:30,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:32,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {15966#true} call ULTIMATE.init(); {15966#true} is VALID [2018-11-23 12:29:32,109 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:29:32,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:32,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15966#true} {15966#true} #66#return; {15966#true} is VALID [2018-11-23 12:29:32,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {15966#true} call #t~ret13 := main(); {15966#true} is VALID [2018-11-23 12:29:32,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {15966#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:32,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {15968#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:32,152 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:29:32,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {15969#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:32,160 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:29:32,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {15970#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:32,161 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:29:32,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {15971#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:32,161 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:29:32,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {15972#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:32,162 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:29:32,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {15973#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:32,163 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:29:32,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {15974#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:32,165 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:29:32,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {15975#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:32,166 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:29:32,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {15976#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:32,168 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:29:32,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {15977#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:32,169 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:29:32,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {15978#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:32,171 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:29:32,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {15979#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:32,172 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:29:32,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {15980#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:32,174 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:29:32,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {15981#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:32,175 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:29:32,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {15982#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:32,177 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:29:32,177 INFO L273 TraceCheckUtils]: 36: Hoare triple {15983#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:32,178 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:29:32,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {15984#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:32,179 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:29:32,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {15985#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:32,181 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:29:32,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {15986#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:32,182 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:29:32,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {15987#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:32,184 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:29:32,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {15988#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:32,185 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:29:32,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {15989#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:32,187 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:29:32,187 INFO L273 TraceCheckUtils]: 50: Hoare triple {15990#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:32,188 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:29:32,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {15991#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:32,190 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:29:32,190 INFO L273 TraceCheckUtils]: 54: Hoare triple {15992#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:32,191 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:29:32,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {15993#(<= main_~i~1 25)} assume !(~i~1 < 10000); {15967#false} is VALID [2018-11-23 12:29:32,192 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:29:32,192 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:29:32,193 INFO L273 TraceCheckUtils]: 59: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,193 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:29:32,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,193 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:29:32,194 INFO L273 TraceCheckUtils]: 63: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,194 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:29:32,194 INFO L273 TraceCheckUtils]: 65: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,195 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:29:32,195 INFO L273 TraceCheckUtils]: 67: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,195 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:29:32,195 INFO L273 TraceCheckUtils]: 69: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,195 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:29:32,196 INFO L273 TraceCheckUtils]: 71: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,196 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:29:32,196 INFO L273 TraceCheckUtils]: 73: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,196 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:29:32,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {15966#true} assume !(~i~0 < 10000); {15966#true} is VALID [2018-11-23 12:29:32,196 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:29:32,196 INFO L273 TraceCheckUtils]: 77: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:32,196 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {15966#true} {15967#false} #70#return; {15967#false} is VALID [2018-11-23 12:29:32,196 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:29:32,197 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:29:32,197 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:29:32,197 INFO L273 TraceCheckUtils]: 82: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,197 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:29:32,197 INFO L273 TraceCheckUtils]: 84: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,197 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:29:32,197 INFO L273 TraceCheckUtils]: 86: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,197 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:29:32,197 INFO L273 TraceCheckUtils]: 88: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,197 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:29:32,198 INFO L273 TraceCheckUtils]: 90: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,198 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:29:32,198 INFO L273 TraceCheckUtils]: 92: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,198 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:29:32,198 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,198 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:29:32,198 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,198 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:29:32,198 INFO L273 TraceCheckUtils]: 98: Hoare triple {15966#true} assume !(~i~0 < 10000); {15966#true} is VALID [2018-11-23 12:29:32,199 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:29:32,199 INFO L273 TraceCheckUtils]: 100: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:32,199 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {15966#true} {15967#false} #72#return; {15967#false} is VALID [2018-11-23 12:29:32,199 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:29:32,199 INFO L273 TraceCheckUtils]: 103: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,199 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:29:32,199 INFO L273 TraceCheckUtils]: 105: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,199 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:29:32,200 INFO L273 TraceCheckUtils]: 107: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,200 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:29:32,200 INFO L273 TraceCheckUtils]: 109: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,200 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:29:32,200 INFO L273 TraceCheckUtils]: 111: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,200 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:29:32,200 INFO L273 TraceCheckUtils]: 113: Hoare triple {15967#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:32,200 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:29:32,200 INFO L273 TraceCheckUtils]: 115: Hoare triple {15967#false} assume !(~i~2 < 9999); {15967#false} is VALID [2018-11-23 12:29:32,200 INFO L273 TraceCheckUtils]: 116: Hoare triple {15967#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15967#false} is VALID [2018-11-23 12:29:32,201 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:29:32,201 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:29:32,201 INFO L273 TraceCheckUtils]: 119: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,201 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:29:32,201 INFO L273 TraceCheckUtils]: 121: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,201 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:29:32,201 INFO L273 TraceCheckUtils]: 123: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,201 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:29:32,201 INFO L273 TraceCheckUtils]: 125: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,202 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:29:32,202 INFO L273 TraceCheckUtils]: 127: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,202 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:29:32,202 INFO L273 TraceCheckUtils]: 129: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,202 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:29:32,202 INFO L273 TraceCheckUtils]: 131: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,202 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:29:32,203 INFO L273 TraceCheckUtils]: 133: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:32,203 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:29:32,203 INFO L273 TraceCheckUtils]: 135: Hoare triple {15966#true} assume !(~i~0 < 10000); {15966#true} is VALID [2018-11-23 12:29:32,203 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:29:32,203 INFO L273 TraceCheckUtils]: 137: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:32,203 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {15966#true} {15967#false} #74#return; {15967#false} is VALID [2018-11-23 12:29:32,203 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:29:32,204 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:29:32,204 INFO L273 TraceCheckUtils]: 141: Hoare triple {15967#false} assume !false; {15967#false} is VALID [2018-11-23 12:29:32,213 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:29:32,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:32,214 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:29:32,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:33,066 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:29:33,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:33,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:34,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {15966#true} call ULTIMATE.init(); {15966#true} is VALID [2018-11-23 12:29:34,326 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:29:34,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:34,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15966#true} {15966#true} #66#return; {15966#true} is VALID [2018-11-23 12:29:34,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {15966#true} call #t~ret13 := main(); {15966#true} is VALID [2018-11-23 12:29:34,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {15966#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15966#true} is VALID [2018-11-23 12:29:34,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,327 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:29:34,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,327 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:29:34,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,328 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:29:34,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,328 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:29:34,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,328 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:29:34,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,328 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:29:34,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,329 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:29:34,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,329 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:29:34,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,329 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:29:34,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,329 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:29:34,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,329 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:29:34,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,330 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:29:34,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,330 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:29:34,330 INFO L273 TraceCheckUtils]: 32: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,330 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:29:34,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,330 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:29:34,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,330 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:29:34,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,331 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:29:34,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,331 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:29:34,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,331 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:29:34,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,331 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:29:34,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,332 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:29:34,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,332 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:29:34,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,332 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:29:34,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,332 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:29:34,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {15966#true} assume !!(~i~1 < 10000);assume -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:29:34,332 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:29:34,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {15966#true} assume !(~i~1 < 10000); {15966#true} is VALID [2018-11-23 12:29:34,333 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:29:34,333 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:29:34,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,333 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:29:34,333 INFO L273 TraceCheckUtils]: 61: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,333 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:29:34,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,333 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:29:34,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,334 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:29:34,334 INFO L273 TraceCheckUtils]: 67: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,334 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:29:34,334 INFO L273 TraceCheckUtils]: 69: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,334 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:29:34,334 INFO L273 TraceCheckUtils]: 71: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,334 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:29:34,334 INFO L273 TraceCheckUtils]: 73: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,334 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:29:34,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {15966#true} assume !(~i~0 < 10000); {15966#true} is VALID [2018-11-23 12:29:34,335 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:29:34,335 INFO L273 TraceCheckUtils]: 77: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:34,335 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {15966#true} {15966#true} #70#return; {15966#true} is VALID [2018-11-23 12:29:34,335 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:29:34,335 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:29:34,335 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:29:34,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,335 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:29:34,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,336 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:29:34,336 INFO L273 TraceCheckUtils]: 86: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,336 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:29:34,336 INFO L273 TraceCheckUtils]: 88: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,336 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:29:34,336 INFO L273 TraceCheckUtils]: 90: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,336 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:29:34,336 INFO L273 TraceCheckUtils]: 92: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,336 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:29:34,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,337 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:29:34,337 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#true} assume !!(~i~0 < 10000);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:29:34,337 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:29:34,337 INFO L273 TraceCheckUtils]: 98: Hoare triple {15966#true} assume !(~i~0 < 10000); {15966#true} is VALID [2018-11-23 12:29:34,337 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:29:34,337 INFO L273 TraceCheckUtils]: 100: Hoare triple {15966#true} assume true; {15966#true} is VALID [2018-11-23 12:29:34,337 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {15966#true} {15966#true} #72#return; {15966#true} is VALID [2018-11-23 12:29:34,338 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:29:34,339 INFO L273 TraceCheckUtils]: 103: Hoare triple {16303#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,339 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:29:34,340 INFO L273 TraceCheckUtils]: 105: Hoare triple {16310#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,340 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:29:34,341 INFO L273 TraceCheckUtils]: 107: Hoare triple {16317#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,341 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:29:34,342 INFO L273 TraceCheckUtils]: 109: Hoare triple {16324#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,343 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:29:34,343 INFO L273 TraceCheckUtils]: 111: Hoare triple {16331#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,344 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:29:34,344 INFO L273 TraceCheckUtils]: 113: Hoare triple {16338#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:34,345 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:29:34,346 INFO L273 TraceCheckUtils]: 115: Hoare triple {16345#(<= main_~i~2 6)} assume !(~i~2 < 9999); {15967#false} is VALID [2018-11-23 12:29:34,346 INFO L273 TraceCheckUtils]: 116: Hoare triple {15967#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15967#false} is VALID [2018-11-23 12:29:34,346 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:29:34,346 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:29:34,347 INFO L273 TraceCheckUtils]: 119: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,347 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:29:34,347 INFO L273 TraceCheckUtils]: 121: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,347 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:29:34,347 INFO L273 TraceCheckUtils]: 123: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,347 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:29:34,348 INFO L273 TraceCheckUtils]: 125: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,348 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:29:34,348 INFO L273 TraceCheckUtils]: 127: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,348 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:29:34,348 INFO L273 TraceCheckUtils]: 129: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,349 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:29:34,349 INFO L273 TraceCheckUtils]: 131: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,349 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:29:34,349 INFO L273 TraceCheckUtils]: 133: Hoare triple {15967#false} assume !!(~i~0 < 10000);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:29:34,349 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:29:34,349 INFO L273 TraceCheckUtils]: 135: Hoare triple {15967#false} assume !(~i~0 < 10000); {15967#false} is VALID [2018-11-23 12:29:34,350 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:29:34,350 INFO L273 TraceCheckUtils]: 137: Hoare triple {15967#false} assume true; {15967#false} is VALID [2018-11-23 12:29:34,350 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {15967#false} {15967#false} #74#return; {15967#false} is VALID [2018-11-23 12:29:34,350 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:29:34,350 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:29:34,350 INFO L273 TraceCheckUtils]: 141: Hoare triple {15967#false} assume !false; {15967#false} is VALID [2018-11-23 12:29:34,358 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:29:34,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2018-11-23 12:29:34,378 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-11-23 12:29:34,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:34,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:29:35,002 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:35,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:29:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:29:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:29:35,004 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 35 states. [2018-11-23 12:29:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:36,100 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-23 12:29:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:29:36,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-11-23 12:29:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:29:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 119 transitions. [2018-11-23 12:29:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:29:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 119 transitions. [2018-11-23 12:29:36,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 119 transitions. [2018-11-23 12:29:36,229 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:29:36,231 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:29:36,232 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:29:36,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:29:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:29:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 12:29:36,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:36,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 12:29:36,313 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 12:29:36,313 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 12:29:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:36,316 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-23 12:29:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:29:36,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:36,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:36,317 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 12:29:36,317 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 12:29:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:36,319 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-23 12:29:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:29:36,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:36,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:36,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:36,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:29:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:29:36,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 142 [2018-11-23 12:29:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:36,322 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:29:36,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:29:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:29:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:29:36,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:36,324 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:29:36,324 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:36,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 25 times [2018-11-23 12:29:36,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:36,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:36,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:36,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:36,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {17020#true} call ULTIMATE.init(); {17020#true} is VALID [2018-11-23 12:29:36,804 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:29:36,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:29:36,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17020#true} {17020#true} #66#return; {17020#true} is VALID [2018-11-23 12:29:36,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {17020#true} call #t~ret13 := main(); {17020#true} is VALID [2018-11-23 12:29:36,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {17020#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:36,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {17022#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:36,807 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:29:36,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {17023#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:36,808 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:29:36,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {17024#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:36,809 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:29:36,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {17025#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:36,809 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:29:36,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {17026#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:36,810 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:29:36,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {17027#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:36,812 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:29:36,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {17028#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:36,813 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:29:36,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {17029#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:36,814 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:29:36,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {17030#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:36,815 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:29:36,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {17031#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:36,817 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:29:36,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {17032#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:36,818 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:29:36,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {17033#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:36,819 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:29:36,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {17034#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:36,820 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:29:36,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {17035#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:36,822 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:29:36,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {17036#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:36,823 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:29:36,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {17037#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:36,824 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:29:36,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {17038#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:36,825 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:29:36,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {17039#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:36,827 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:29:36,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {17040#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:36,828 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:29:36,828 INFO L273 TraceCheckUtils]: 44: Hoare triple {17041#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:36,829 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:29:36,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {17042#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:36,830 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:29:36,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {17043#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:36,832 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:29:36,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {17044#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:36,833 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:29:36,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {17045#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:36,834 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:29:36,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {17046#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:36,835 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:29:36,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {17047#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:36,837 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:29:36,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {17048#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17021#false} is VALID [2018-11-23 12:29:36,838 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:29:36,838 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:29:36,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,838 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:29:36,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,838 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:29:36,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,839 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:29:36,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,839 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:29:36,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,840 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:29:36,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,840 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:29:36,840 INFO L273 TraceCheckUtils]: 73: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,840 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:29:36,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,841 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:29:36,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {17020#true} assume !(~i~0 < 10000); {17020#true} is VALID [2018-11-23 12:29:36,841 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:29:36,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:29:36,841 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17020#true} {17021#false} #70#return; {17021#false} is VALID [2018-11-23 12:29:36,842 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:29:36,842 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:29:36,842 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:29:36,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,842 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:29:36,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,843 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:29:36,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,843 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:29:36,843 INFO L273 TraceCheckUtils]: 90: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,843 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:29:36,843 INFO L273 TraceCheckUtils]: 92: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,843 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:29:36,843 INFO L273 TraceCheckUtils]: 94: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,843 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:29:36,844 INFO L273 TraceCheckUtils]: 96: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,844 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:29:36,844 INFO L273 TraceCheckUtils]: 98: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,844 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:29:36,844 INFO L273 TraceCheckUtils]: 100: Hoare triple {17020#true} assume !(~i~0 < 10000); {17020#true} is VALID [2018-11-23 12:29:36,844 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:29:36,844 INFO L273 TraceCheckUtils]: 102: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:29:36,844 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17020#true} {17021#false} #72#return; {17021#false} is VALID [2018-11-23 12:29:36,844 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:29:36,845 INFO L273 TraceCheckUtils]: 105: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,845 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:29:36,845 INFO L273 TraceCheckUtils]: 107: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,845 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:29:36,845 INFO L273 TraceCheckUtils]: 109: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,845 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:29:36,845 INFO L273 TraceCheckUtils]: 111: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,845 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:29:36,845 INFO L273 TraceCheckUtils]: 113: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,846 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:29:36,846 INFO L273 TraceCheckUtils]: 115: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,846 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:29:36,846 INFO L273 TraceCheckUtils]: 117: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:36,846 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:29:36,846 INFO L273 TraceCheckUtils]: 119: Hoare triple {17021#false} assume !(~i~2 < 9999); {17021#false} is VALID [2018-11-23 12:29:36,846 INFO L273 TraceCheckUtils]: 120: Hoare triple {17021#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:29:36,846 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:29:36,846 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:29:36,846 INFO L273 TraceCheckUtils]: 123: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,847 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:29:36,847 INFO L273 TraceCheckUtils]: 125: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,847 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:29:36,847 INFO L273 TraceCheckUtils]: 127: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,847 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:29:36,847 INFO L273 TraceCheckUtils]: 129: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,847 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:29:36,847 INFO L273 TraceCheckUtils]: 131: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,847 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:29:36,848 INFO L273 TraceCheckUtils]: 133: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,848 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:29:36,848 INFO L273 TraceCheckUtils]: 135: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,848 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:29:36,848 INFO L273 TraceCheckUtils]: 137: Hoare triple {17020#true} assume !!(~i~0 < 10000);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:29:36,848 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:29:36,848 INFO L273 TraceCheckUtils]: 139: Hoare triple {17020#true} assume !(~i~0 < 10000); {17020#true} is VALID [2018-11-23 12:29:36,848 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:29:36,848 INFO L273 TraceCheckUtils]: 141: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:29:36,848 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17020#true} {17021#false} #74#return; {17021#false} is VALID [2018-11-23 12:29:36,849 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:29:36,849 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:29:36,849 INFO L273 TraceCheckUtils]: 145: Hoare triple {17021#false} assume !false; {17021#false} is VALID [2018-11-23 12:29:36,859 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:29:36,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:36,859 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:29:36,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:36,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:37,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {17020#true} call ULTIMATE.init(); {17020#true} is VALID [2018-11-23 12:29:37,198 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:29:37,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {17020#true} assume true; {17020#true} is VALID [2018-11-23 12:29:37,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17020#true} {17020#true} #66#return; {17020#true} is VALID [2018-11-23 12:29:37,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {17020#true} call #t~ret13 := main(); {17020#true} is VALID [2018-11-23 12:29:37,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {17020#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:37,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {17067#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:37,201 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:29:37,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {17023#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:37,202 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:29:37,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {17024#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:37,204 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:29:37,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {17025#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:37,205 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:29:37,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {17026#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:37,206 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:29:37,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {17027#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:37,207 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:29:37,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {17028#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:37,209 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:29:37,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {17029#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:37,210 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:29:37,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {17030#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:37,211 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:29:37,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {17031#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:37,212 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:29:37,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {17032#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:37,214 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:29:37,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {17033#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:37,215 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:29:37,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {17034#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:37,216 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:29:37,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {17035#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:37,217 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:29:37,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {17036#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:37,219 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:29:37,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {17037#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:37,220 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:29:37,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {17038#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:37,221 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:29:37,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {17039#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:37,222 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:29:37,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {17040#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:37,224 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:29:37,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {17041#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:37,225 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:29:37,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {17042#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:37,226 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:29:37,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {17043#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:37,227 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:29:37,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {17044#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:37,229 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:29:37,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {17045#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:37,230 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:29:37,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {17046#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:37,231 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:29:37,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {17047#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:37,232 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:29:37,233 INFO L273 TraceCheckUtils]: 58: Hoare triple {17048#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17021#false} is VALID [2018-11-23 12:29:37,233 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:29:37,233 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:29:37,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,234 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:29:37,234 INFO L273 TraceCheckUtils]: 63: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,234 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:29:37,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,234 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:29:37,235 INFO L273 TraceCheckUtils]: 67: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,235 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:29:37,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,235 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:29:37,235 INFO L273 TraceCheckUtils]: 71: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,235 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:29:37,236 INFO L273 TraceCheckUtils]: 73: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,236 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:29:37,236 INFO L273 TraceCheckUtils]: 75: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,236 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:29:37,236 INFO L273 TraceCheckUtils]: 77: Hoare triple {17021#false} assume !(~i~0 < 10000); {17021#false} is VALID [2018-11-23 12:29:37,236 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:29:37,236 INFO L273 TraceCheckUtils]: 79: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:29:37,236 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17021#false} {17021#false} #70#return; {17021#false} is VALID [2018-11-23 12:29:37,236 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:29:37,237 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:29:37,237 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:29:37,237 INFO L273 TraceCheckUtils]: 84: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,237 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:29:37,237 INFO L273 TraceCheckUtils]: 86: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,237 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:29:37,237 INFO L273 TraceCheckUtils]: 88: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,237 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:29:37,237 INFO L273 TraceCheckUtils]: 90: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,237 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:29:37,238 INFO L273 TraceCheckUtils]: 92: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,238 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:29:37,238 INFO L273 TraceCheckUtils]: 94: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,238 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:29:37,238 INFO L273 TraceCheckUtils]: 96: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,238 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:29:37,238 INFO L273 TraceCheckUtils]: 98: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,238 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:29:37,238 INFO L273 TraceCheckUtils]: 100: Hoare triple {17021#false} assume !(~i~0 < 10000); {17021#false} is VALID [2018-11-23 12:29:37,239 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:29:37,239 INFO L273 TraceCheckUtils]: 102: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:29:37,239 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17021#false} {17021#false} #72#return; {17021#false} is VALID [2018-11-23 12:29:37,239 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:29:37,239 INFO L273 TraceCheckUtils]: 105: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,239 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:29:37,239 INFO L273 TraceCheckUtils]: 107: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,239 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:29:37,239 INFO L273 TraceCheckUtils]: 109: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,239 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:29:37,240 INFO L273 TraceCheckUtils]: 111: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,240 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:29:37,240 INFO L273 TraceCheckUtils]: 113: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,240 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:29:37,240 INFO L273 TraceCheckUtils]: 115: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,240 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:29:37,240 INFO L273 TraceCheckUtils]: 117: Hoare triple {17021#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:37,240 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:29:37,240 INFO L273 TraceCheckUtils]: 119: Hoare triple {17021#false} assume !(~i~2 < 9999); {17021#false} is VALID [2018-11-23 12:29:37,241 INFO L273 TraceCheckUtils]: 120: Hoare triple {17021#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17021#false} is VALID [2018-11-23 12:29:37,241 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:29:37,241 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:29:37,241 INFO L273 TraceCheckUtils]: 123: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,241 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:29:37,241 INFO L273 TraceCheckUtils]: 125: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,241 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:29:37,241 INFO L273 TraceCheckUtils]: 127: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,241 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:29:37,241 INFO L273 TraceCheckUtils]: 129: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,242 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:29:37,242 INFO L273 TraceCheckUtils]: 131: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,242 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:29:37,242 INFO L273 TraceCheckUtils]: 133: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,242 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:29:37,242 INFO L273 TraceCheckUtils]: 135: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,242 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:29:37,242 INFO L273 TraceCheckUtils]: 137: Hoare triple {17021#false} assume !!(~i~0 < 10000);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:29:37,242 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:29:37,243 INFO L273 TraceCheckUtils]: 139: Hoare triple {17021#false} assume !(~i~0 < 10000); {17021#false} is VALID [2018-11-23 12:29:37,243 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:29:37,243 INFO L273 TraceCheckUtils]: 141: Hoare triple {17021#false} assume true; {17021#false} is VALID [2018-11-23 12:29:37,243 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17021#false} {17021#false} #74#return; {17021#false} is VALID [2018-11-23 12:29:37,243 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:29:37,243 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:29:37,243 INFO L273 TraceCheckUtils]: 145: Hoare triple {17021#false} assume !false; {17021#false} is VALID [2018-11-23 12:29:37,253 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:29:37,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:29:37,274 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:29:37,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:37,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:29:37,369 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:29:37,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:29:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:29:37,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:29:37,370 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:29:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,301 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:29:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:29:38,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:29:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:29:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:29:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:29:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:29:38,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:29:38,409 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:29:38,411 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:29:38,411 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:29:38,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:29:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:29:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:29:38,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:38,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:29:38,467 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:29:38,467 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:29:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,469 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:29:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:29:38,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:38,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:38,470 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:29:38,470 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:29:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,472 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:29:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:29:38,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:38,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:38,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:38,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:29:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:29:38,476 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:29:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:38,476 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:29:38,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:29:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:29:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:29:38,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:38,477 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:29:38,478 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:38,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 26 times [2018-11-23 12:29:38,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:38,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:38,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:38,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:38,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:39,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2018-11-23 12:29:39,054 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:29:39,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:29:39,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #66#return; {18091#true} is VALID [2018-11-23 12:29:39,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret13 := main(); {18091#true} is VALID [2018-11-23 12:29:39,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {18091#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:39,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {18093#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:39,056 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:29:39,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {18094#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:39,057 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:29:39,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {18095#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:39,058 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:29:39,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {18096#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:39,059 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:29:39,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {18097#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:39,060 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:29:39,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {18098#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:39,061 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:29:39,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {18099#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:39,063 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:29:39,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {18100#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:39,064 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:29:39,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {18101#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:39,065 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:29:39,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {18102#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:39,066 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:29:39,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {18103#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:39,068 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:29:39,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {18104#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:39,069 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:29:39,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {18105#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:39,070 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:29:39,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {18106#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:39,071 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:29:39,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {18107#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:39,072 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:29:39,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {18108#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:39,074 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:29:39,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {18109#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:39,075 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:29:39,075 INFO L273 TraceCheckUtils]: 40: Hoare triple {18110#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:39,076 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:29:39,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {18111#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:39,077 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:29:39,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {18112#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:39,079 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:29:39,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {18113#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:39,080 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:29:39,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {18114#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:39,081 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:29:39,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {18115#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:39,083 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:29:39,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {18116#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:39,084 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:29:39,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {18117#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:39,085 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:29:39,086 INFO L273 TraceCheckUtils]: 56: Hoare triple {18118#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:39,086 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:29:39,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {18119#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:29:39,088 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:29:39,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {18120#(<= main_~i~1 27)} assume !(~i~1 < 10000); {18092#false} is VALID [2018-11-23 12:29:39,088 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:29:39,089 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:29:39,089 INFO L273 TraceCheckUtils]: 63: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,089 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:29:39,089 INFO L273 TraceCheckUtils]: 65: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,089 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:29:39,090 INFO L273 TraceCheckUtils]: 67: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,090 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:29:39,090 INFO L273 TraceCheckUtils]: 69: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,090 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:29:39,090 INFO L273 TraceCheckUtils]: 71: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,090 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:29:39,091 INFO L273 TraceCheckUtils]: 73: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,091 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:29:39,091 INFO L273 TraceCheckUtils]: 75: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,091 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:29:39,091 INFO L273 TraceCheckUtils]: 77: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,091 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:29:39,092 INFO L273 TraceCheckUtils]: 79: Hoare triple {18091#true} assume !(~i~0 < 10000); {18091#true} is VALID [2018-11-23 12:29:39,092 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:29:39,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:29:39,092 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {18091#true} {18092#false} #70#return; {18092#false} is VALID [2018-11-23 12:29:39,092 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:29:39,093 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:29:39,093 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:29:39,093 INFO L273 TraceCheckUtils]: 86: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,093 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:29:39,093 INFO L273 TraceCheckUtils]: 88: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,093 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:29:39,093 INFO L273 TraceCheckUtils]: 90: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,093 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:29:39,094 INFO L273 TraceCheckUtils]: 92: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,094 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:29:39,094 INFO L273 TraceCheckUtils]: 94: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,094 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:29:39,094 INFO L273 TraceCheckUtils]: 96: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,094 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:29:39,094 INFO L273 TraceCheckUtils]: 98: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,094 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:29:39,094 INFO L273 TraceCheckUtils]: 100: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,095 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:29:39,095 INFO L273 TraceCheckUtils]: 102: Hoare triple {18091#true} assume !(~i~0 < 10000); {18091#true} is VALID [2018-11-23 12:29:39,095 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:29:39,095 INFO L273 TraceCheckUtils]: 104: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:29:39,095 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {18091#true} {18092#false} #72#return; {18092#false} is VALID [2018-11-23 12:29:39,095 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:29:39,095 INFO L273 TraceCheckUtils]: 107: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,095 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:29:39,095 INFO L273 TraceCheckUtils]: 109: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,095 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:29:39,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,096 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:29:39,096 INFO L273 TraceCheckUtils]: 113: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,096 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:29:39,096 INFO L273 TraceCheckUtils]: 115: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,096 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:29:39,096 INFO L273 TraceCheckUtils]: 117: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,096 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:29:39,096 INFO L273 TraceCheckUtils]: 119: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,097 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:29:39,097 INFO L273 TraceCheckUtils]: 121: Hoare triple {18092#false} assume !(~i~2 < 9999); {18092#false} is VALID [2018-11-23 12:29:39,097 INFO L273 TraceCheckUtils]: 122: Hoare triple {18092#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:29:39,097 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:29:39,097 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:29:39,097 INFO L273 TraceCheckUtils]: 125: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,097 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:29:39,097 INFO L273 TraceCheckUtils]: 127: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,097 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:29:39,097 INFO L273 TraceCheckUtils]: 129: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,098 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:29:39,098 INFO L273 TraceCheckUtils]: 131: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,098 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:29:39,098 INFO L273 TraceCheckUtils]: 133: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,098 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:29:39,098 INFO L273 TraceCheckUtils]: 135: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,098 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:29:39,098 INFO L273 TraceCheckUtils]: 137: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,098 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:29:39,099 INFO L273 TraceCheckUtils]: 139: Hoare triple {18091#true} assume !!(~i~0 < 10000);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:29:39,099 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:29:39,099 INFO L273 TraceCheckUtils]: 141: Hoare triple {18091#true} assume !(~i~0 < 10000); {18091#true} is VALID [2018-11-23 12:29:39,099 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:29:39,099 INFO L273 TraceCheckUtils]: 143: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:29:39,099 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {18091#true} {18092#false} #74#return; {18092#false} is VALID [2018-11-23 12:29:39,099 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:29:39,099 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:29:39,099 INFO L273 TraceCheckUtils]: 147: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2018-11-23 12:29:39,110 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:29:39,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:39,110 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:29:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:39,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:39,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:39,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:39,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2018-11-23 12:29:39,710 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:29:39,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2018-11-23 12:29:39,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #66#return; {18091#true} is VALID [2018-11-23 12:29:39,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret13 := main(); {18091#true} is VALID [2018-11-23 12:29:39,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {18091#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:39,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {18139#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:39,712 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:29:39,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {18094#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:39,713 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:29:39,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {18095#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:39,714 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:29:39,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {18096#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:39,715 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:29:39,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {18097#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:39,716 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:29:39,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {18098#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:39,717 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:29:39,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {18099#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:39,719 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:29:39,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {18100#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:39,720 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:29:39,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {18101#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:39,721 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:29:39,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {18102#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:39,722 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:29:39,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {18103#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:39,724 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:29:39,724 INFO L273 TraceCheckUtils]: 28: Hoare triple {18104#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:39,725 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:29:39,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {18105#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:39,726 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:29:39,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {18106#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:39,727 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:29:39,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {18107#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:39,729 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:29:39,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {18108#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:39,730 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:29:39,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {18109#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:39,731 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:29:39,732 INFO L273 TraceCheckUtils]: 40: Hoare triple {18110#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:39,732 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:29:39,733 INFO L273 TraceCheckUtils]: 42: Hoare triple {18111#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:39,734 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:29:39,734 INFO L273 TraceCheckUtils]: 44: Hoare triple {18112#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:39,735 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:29:39,735 INFO L273 TraceCheckUtils]: 46: Hoare triple {18113#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:39,736 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:29:39,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {18114#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:39,737 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:29:39,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {18115#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:39,738 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:29:39,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {18116#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:39,740 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:29:39,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {18117#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:39,741 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:29:39,742 INFO L273 TraceCheckUtils]: 56: Hoare triple {18118#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:39,742 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:29:39,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {18119#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:29:39,743 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:29:39,744 INFO L273 TraceCheckUtils]: 60: Hoare triple {18120#(<= main_~i~1 27)} assume !(~i~1 < 10000); {18092#false} is VALID [2018-11-23 12:29:39,744 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:29:39,745 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:29:39,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,745 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:29:39,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,745 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:29:39,745 INFO L273 TraceCheckUtils]: 67: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,746 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:29:39,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,746 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:29:39,746 INFO L273 TraceCheckUtils]: 71: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,746 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:29:39,747 INFO L273 TraceCheckUtils]: 73: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,747 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:29:39,747 INFO L273 TraceCheckUtils]: 75: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,747 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:29:39,747 INFO L273 TraceCheckUtils]: 77: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,747 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:29:39,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {18092#false} assume !(~i~0 < 10000); {18092#false} is VALID [2018-11-23 12:29:39,748 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:29:39,748 INFO L273 TraceCheckUtils]: 81: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:29:39,748 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {18092#false} {18092#false} #70#return; {18092#false} is VALID [2018-11-23 12:29:39,748 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:29:39,749 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:29:39,749 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:29:39,749 INFO L273 TraceCheckUtils]: 86: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,749 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:29:39,749 INFO L273 TraceCheckUtils]: 88: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,749 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:29:39,749 INFO L273 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,750 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:29:39,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,750 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:29:39,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,750 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:29:39,750 INFO L273 TraceCheckUtils]: 96: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,750 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:29:39,750 INFO L273 TraceCheckUtils]: 98: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,750 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:29:39,750 INFO L273 TraceCheckUtils]: 100: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,751 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:29:39,751 INFO L273 TraceCheckUtils]: 102: Hoare triple {18092#false} assume !(~i~0 < 10000); {18092#false} is VALID [2018-11-23 12:29:39,751 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:29:39,751 INFO L273 TraceCheckUtils]: 104: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:29:39,751 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {18092#false} {18092#false} #72#return; {18092#false} is VALID [2018-11-23 12:29:39,751 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:29:39,751 INFO L273 TraceCheckUtils]: 107: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,751 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:29:39,751 INFO L273 TraceCheckUtils]: 109: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,752 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:29:39,752 INFO L273 TraceCheckUtils]: 111: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,752 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:29:39,752 INFO L273 TraceCheckUtils]: 113: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,752 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:29:39,752 INFO L273 TraceCheckUtils]: 115: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,752 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:29:39,752 INFO L273 TraceCheckUtils]: 117: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,752 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:29:39,752 INFO L273 TraceCheckUtils]: 119: Hoare triple {18092#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:39,753 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:29:39,753 INFO L273 TraceCheckUtils]: 121: Hoare triple {18092#false} assume !(~i~2 < 9999); {18092#false} is VALID [2018-11-23 12:29:39,753 INFO L273 TraceCheckUtils]: 122: Hoare triple {18092#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {18092#false} is VALID [2018-11-23 12:29:39,753 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:29:39,753 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:29:39,753 INFO L273 TraceCheckUtils]: 125: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,753 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:29:39,753 INFO L273 TraceCheckUtils]: 127: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,753 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:29:39,754 INFO L273 TraceCheckUtils]: 129: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,754 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:29:39,754 INFO L273 TraceCheckUtils]: 131: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,754 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:29:39,754 INFO L273 TraceCheckUtils]: 133: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,754 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:29:39,754 INFO L273 TraceCheckUtils]: 135: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,754 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:29:39,754 INFO L273 TraceCheckUtils]: 137: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,754 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:29:39,755 INFO L273 TraceCheckUtils]: 139: Hoare triple {18092#false} assume !!(~i~0 < 10000);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:29:39,755 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:29:39,755 INFO L273 TraceCheckUtils]: 141: Hoare triple {18092#false} assume !(~i~0 < 10000); {18092#false} is VALID [2018-11-23 12:29:39,755 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:29:39,755 INFO L273 TraceCheckUtils]: 143: Hoare triple {18092#false} assume true; {18092#false} is VALID [2018-11-23 12:29:39,755 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {18092#false} {18092#false} #74#return; {18092#false} is VALID [2018-11-23 12:29:39,755 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:29:39,755 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:29:39,755 INFO L273 TraceCheckUtils]: 147: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2018-11-23 12:29:39,766 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:29:39,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:39,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:29:39,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:29:39,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:39,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:29:39,879 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:29:39,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:29:39,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:29:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:29:39,881 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2018-11-23 12:29:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:40,401 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-11-23 12:29:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:29:40,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-11-23 12:29:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:29:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:29:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:29:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 108 transitions. [2018-11-23 12:29:40,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 108 transitions. [2018-11-23 12:29:40,550 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:29:40,553 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:29:40,553 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:29:40,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:29:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:29:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-11-23 12:29:40,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:40,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 109 states. [2018-11-23 12:29:40,610 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 109 states. [2018-11-23 12:29:40,610 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 109 states. [2018-11-23 12:29:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:40,612 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:29:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:29:40,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:40,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:40,613 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 110 states. [2018-11-23 12:29:40,613 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 110 states. [2018-11-23 12:29:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:40,614 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 12:29:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-23 12:29:40,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:40,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:40,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:40,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 12:29:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-23 12:29:40,617 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2018-11-23 12:29:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:40,617 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-23 12:29:40,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:29:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-23 12:29:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 12:29:40,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:40,619 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:29:40,619 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:40,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 85718885, now seen corresponding path program 27 times [2018-11-23 12:29:40,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:40,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:40,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:41,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {19179#true} call ULTIMATE.init(); {19179#true} is VALID [2018-11-23 12:29:41,475 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:29:41,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:41,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19179#true} {19179#true} #66#return; {19179#true} is VALID [2018-11-23 12:29:41,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {19179#true} call #t~ret13 := main(); {19179#true} is VALID [2018-11-23 12:29:41,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {19179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:41,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {19181#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:41,478 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:29:41,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {19182#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:41,479 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:29:41,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {19183#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:41,480 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:29:41,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {19184#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:41,482 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:29:41,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {19185#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:41,483 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:29:41,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {19186#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:41,484 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:29:41,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {19187#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:41,485 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:29:41,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {19188#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:41,487 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:29:41,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {19189#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:41,488 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:29:41,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {19190#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:41,489 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:29:41,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {19191#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:41,490 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:29:41,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {19192#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:41,492 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:29:41,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {19193#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:41,493 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:29:41,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {19194#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:41,494 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:29:41,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {19195#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:41,496 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:29:41,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {19196#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:41,497 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:29:41,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {19197#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:41,498 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:29:41,499 INFO L273 TraceCheckUtils]: 40: Hoare triple {19198#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:41,499 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:29:41,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {19199#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:41,500 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:29:41,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {19200#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:41,502 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:29:41,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {19201#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:41,503 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:29:41,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {19202#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:41,504 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:29:41,505 INFO L273 TraceCheckUtils]: 50: Hoare triple {19203#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:41,506 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:29:41,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {19204#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:41,507 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:29:41,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {19205#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:41,508 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:29:41,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {19206#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:41,509 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:29:41,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {19207#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:29:41,511 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:29:41,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {19208#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:29:41,512 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:29:41,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {19209#(<= main_~i~1 28)} assume !(~i~1 < 10000); {19180#false} is VALID [2018-11-23 12:29:41,513 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:29:41,513 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:29:41,513 INFO L273 TraceCheckUtils]: 65: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,513 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:29:41,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,514 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:29:41,514 INFO L273 TraceCheckUtils]: 69: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,514 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:29:41,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,514 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:29:41,514 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,515 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:29:41,515 INFO L273 TraceCheckUtils]: 75: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,515 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:29:41,515 INFO L273 TraceCheckUtils]: 77: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,515 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:29:41,516 INFO L273 TraceCheckUtils]: 79: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,516 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:29:41,516 INFO L273 TraceCheckUtils]: 81: Hoare triple {19179#true} assume !(~i~0 < 10000); {19179#true} is VALID [2018-11-23 12:29:41,516 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:29:41,516 INFO L273 TraceCheckUtils]: 83: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:41,516 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19179#true} {19180#false} #70#return; {19180#false} is VALID [2018-11-23 12:29:41,516 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:29:41,516 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:29:41,516 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:29:41,517 INFO L273 TraceCheckUtils]: 88: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,517 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:29:41,517 INFO L273 TraceCheckUtils]: 90: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,517 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:29:41,517 INFO L273 TraceCheckUtils]: 92: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,517 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:29:41,517 INFO L273 TraceCheckUtils]: 94: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,517 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:29:41,517 INFO L273 TraceCheckUtils]: 96: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,517 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:29:41,518 INFO L273 TraceCheckUtils]: 98: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,518 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:29:41,518 INFO L273 TraceCheckUtils]: 100: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,518 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:29:41,518 INFO L273 TraceCheckUtils]: 102: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,518 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:29:41,518 INFO L273 TraceCheckUtils]: 104: Hoare triple {19179#true} assume !(~i~0 < 10000); {19179#true} is VALID [2018-11-23 12:29:41,518 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:29:41,518 INFO L273 TraceCheckUtils]: 106: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:41,518 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19179#true} {19180#false} #72#return; {19180#false} is VALID [2018-11-23 12:29:41,519 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:29:41,519 INFO L273 TraceCheckUtils]: 109: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,519 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:29:41,519 INFO L273 TraceCheckUtils]: 111: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,519 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:29:41,519 INFO L273 TraceCheckUtils]: 113: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,519 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:29:41,519 INFO L273 TraceCheckUtils]: 115: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,519 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:29:41,519 INFO L273 TraceCheckUtils]: 117: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,520 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:29:41,520 INFO L273 TraceCheckUtils]: 119: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,520 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:29:41,520 INFO L273 TraceCheckUtils]: 121: Hoare triple {19180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:41,520 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:29:41,520 INFO L273 TraceCheckUtils]: 123: Hoare triple {19180#false} assume !(~i~2 < 9999); {19180#false} is VALID [2018-11-23 12:29:41,520 INFO L273 TraceCheckUtils]: 124: Hoare triple {19180#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19180#false} is VALID [2018-11-23 12:29:41,520 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:29:41,520 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:29:41,520 INFO L273 TraceCheckUtils]: 127: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,521 INFO L273 TraceCheckUtils]: 129: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,521 INFO L273 TraceCheckUtils]: 131: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,521 INFO L273 TraceCheckUtils]: 133: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,521 INFO L273 TraceCheckUtils]: 135: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,521 INFO L273 TraceCheckUtils]: 137: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,521 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:29:41,522 INFO L273 TraceCheckUtils]: 139: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,522 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:29:41,522 INFO L273 TraceCheckUtils]: 141: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:41,522 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:29:41,522 INFO L273 TraceCheckUtils]: 143: Hoare triple {19179#true} assume !(~i~0 < 10000); {19179#true} is VALID [2018-11-23 12:29:41,522 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:29:41,522 INFO L273 TraceCheckUtils]: 145: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:41,522 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19179#true} {19180#false} #74#return; {19180#false} is VALID [2018-11-23 12:29:41,522 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:29:41,522 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:29:41,523 INFO L273 TraceCheckUtils]: 149: Hoare triple {19180#false} assume !false; {19180#false} is VALID [2018-11-23 12:29:41,532 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:29:41,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:41,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 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:29:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:41,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:29:41,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:42,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {19179#true} call ULTIMATE.init(); {19179#true} is VALID [2018-11-23 12:29:42,021 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:29:42,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:42,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19179#true} {19179#true} #66#return; {19179#true} is VALID [2018-11-23 12:29:42,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {19179#true} call #t~ret13 := main(); {19179#true} is VALID [2018-11-23 12:29:42,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {19179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19179#true} is VALID [2018-11-23 12:29:42,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,022 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:29:42,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,022 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:29:42,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,023 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:29:42,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,023 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:29:42,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,023 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:29:42,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,024 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:29:42,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,024 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:29:42,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,024 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:29:42,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,024 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:29:42,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,025 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:29:42,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,025 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:29:42,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,025 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:29:42,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,025 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:29:42,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,025 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:29:42,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,026 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:29:42,026 INFO L273 TraceCheckUtils]: 36: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,026 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:29:42,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,026 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:29:42,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,026 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:29:42,026 INFO L273 TraceCheckUtils]: 42: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,026 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:29:42,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,027 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:29:42,027 INFO L273 TraceCheckUtils]: 46: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,027 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:29:42,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,027 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:29:42,027 INFO L273 TraceCheckUtils]: 50: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,027 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:29:42,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,027 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:29:42,028 INFO L273 TraceCheckUtils]: 54: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,028 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:29:42,028 INFO L273 TraceCheckUtils]: 56: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,028 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:29:42,028 INFO L273 TraceCheckUtils]: 58: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,028 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:29:42,028 INFO L273 TraceCheckUtils]: 60: Hoare triple {19179#true} assume !!(~i~1 < 10000);assume -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:29:42,028 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:29:42,028 INFO L273 TraceCheckUtils]: 62: Hoare triple {19179#true} assume !(~i~1 < 10000); {19179#true} is VALID [2018-11-23 12:29:42,029 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:29:42,029 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:29:42,029 INFO L273 TraceCheckUtils]: 65: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,029 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:29:42,029 INFO L273 TraceCheckUtils]: 67: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,029 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:29:42,029 INFO L273 TraceCheckUtils]: 69: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,029 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:29:42,029 INFO L273 TraceCheckUtils]: 71: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,029 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:29:42,030 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,030 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:29:42,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,030 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:29:42,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,030 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:29:42,030 INFO L273 TraceCheckUtils]: 79: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,030 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:29:42,030 INFO L273 TraceCheckUtils]: 81: Hoare triple {19179#true} assume !(~i~0 < 10000); {19179#true} is VALID [2018-11-23 12:29:42,031 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:29:42,031 INFO L273 TraceCheckUtils]: 83: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:42,031 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {19179#true} {19179#true} #70#return; {19179#true} is VALID [2018-11-23 12:29:42,031 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:29:42,031 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:29:42,031 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:29:42,031 INFO L273 TraceCheckUtils]: 88: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,031 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:29:42,031 INFO L273 TraceCheckUtils]: 90: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,032 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:29:42,032 INFO L273 TraceCheckUtils]: 92: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,032 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:29:42,032 INFO L273 TraceCheckUtils]: 94: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,032 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:29:42,032 INFO L273 TraceCheckUtils]: 96: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,032 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:29:42,032 INFO L273 TraceCheckUtils]: 98: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,033 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:29:42,033 INFO L273 TraceCheckUtils]: 100: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,033 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:29:42,033 INFO L273 TraceCheckUtils]: 102: Hoare triple {19179#true} assume !!(~i~0 < 10000);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:29:42,033 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:29:42,033 INFO L273 TraceCheckUtils]: 104: Hoare triple {19179#true} assume !(~i~0 < 10000); {19179#true} is VALID [2018-11-23 12:29:42,034 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:29:42,034 INFO L273 TraceCheckUtils]: 106: Hoare triple {19179#true} assume true; {19179#true} is VALID [2018-11-23 12:29:42,034 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19179#true} {19179#true} #72#return; {19179#true} is VALID [2018-11-23 12:29:42,051 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:29:42,060 INFO L273 TraceCheckUtils]: 109: Hoare triple {19537#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,061 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:29:42,065 INFO L273 TraceCheckUtils]: 111: Hoare triple {19544#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,065 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:29:42,067 INFO L273 TraceCheckUtils]: 113: Hoare triple {19551#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,075 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:29:42,075 INFO L273 TraceCheckUtils]: 115: Hoare triple {19558#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,076 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:29:42,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {19565#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,076 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:29:42,077 INFO L273 TraceCheckUtils]: 119: Hoare triple {19572#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,077 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:29:42,077 INFO L273 TraceCheckUtils]: 121: Hoare triple {19579#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:42,078 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:29:42,078 INFO L273 TraceCheckUtils]: 123: Hoare triple {19586#(<= main_~i~2 7)} assume !(~i~2 < 9999); {19180#false} is VALID [2018-11-23 12:29:42,078 INFO L273 TraceCheckUtils]: 124: Hoare triple {19180#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19180#false} is VALID [2018-11-23 12:29:42,079 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:29:42,079 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:29:42,079 INFO L273 TraceCheckUtils]: 127: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,079 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:29:42,079 INFO L273 TraceCheckUtils]: 129: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,079 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:29:42,080 INFO L273 TraceCheckUtils]: 131: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,080 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:29:42,080 INFO L273 TraceCheckUtils]: 133: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,080 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:29:42,080 INFO L273 TraceCheckUtils]: 135: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,081 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:29:42,081 INFO L273 TraceCheckUtils]: 137: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,081 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:29:42,081 INFO L273 TraceCheckUtils]: 139: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,081 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:29:42,081 INFO L273 TraceCheckUtils]: 141: Hoare triple {19180#false} assume !!(~i~0 < 10000);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:29:42,082 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:29:42,082 INFO L273 TraceCheckUtils]: 143: Hoare triple {19180#false} assume !(~i~0 < 10000); {19180#false} is VALID [2018-11-23 12:29:42,082 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:29:42,082 INFO L273 TraceCheckUtils]: 145: Hoare triple {19180#false} assume true; {19180#false} is VALID [2018-11-23 12:29:42,082 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {19180#false} {19180#false} #74#return; {19180#false} is VALID [2018-11-23 12:29:42,082 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:29:42,082 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:29:42,082 INFO L273 TraceCheckUtils]: 149: Hoare triple {19180#false} assume !false; {19180#false} is VALID [2018-11-23 12:29:42,091 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:29:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2018-11-23 12:29:42,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:29:42,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:42,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:29:42,470 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:29:42,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:29:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:29:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:29:42,472 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2018-11-23 12:29:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:43,031 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-23 12:29:43,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:29:43,031 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-11-23 12:29:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:29:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:29:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:29:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 127 transitions. [2018-11-23 12:29:43,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 127 transitions. [2018-11-23 12:29:43,175 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:29:43,178 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:29:43,178 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:29:43,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:29:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:29:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-23 12:29:43,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:43,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-23 12:29:43,239 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-23 12:29:43,239 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-23 12:29:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:43,242 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:29:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:29:43,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:43,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:43,244 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-23 12:29:43,244 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-23 12:29:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:43,246 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 12:29:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:29:43,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:43,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:43,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:43,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:29:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-23 12:29:43,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2018-11-23 12:29:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:43,251 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-23 12:29:43,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:29:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:29:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:29:43,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:43,252 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:29:43,253 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:43,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1448030523, now seen corresponding path program 28 times [2018-11-23 12:29:43,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:43,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:44,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {20304#true} call ULTIMATE.init(); {20304#true} is VALID [2018-11-23 12:29:44,035 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:29:44,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20304#true} {20304#true} #66#return; {20304#true} is VALID [2018-11-23 12:29:44,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {20304#true} call #t~ret13 := main(); {20304#true} is VALID [2018-11-23 12:29:44,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {20304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:44,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {20306#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:44,037 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:29:44,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {20307#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:44,038 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:29:44,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {20308#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:44,039 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:29:44,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {20309#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:44,040 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:29:44,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {20310#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:44,042 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:29:44,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {20311#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:44,043 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:29:44,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {20312#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:44,045 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:29:44,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {20313#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:44,046 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:29:44,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {20314#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:44,048 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:29:44,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {20315#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:44,049 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:29:44,050 INFO L273 TraceCheckUtils]: 26: Hoare triple {20316#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:44,051 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:29:44,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {20317#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:44,052 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:29:44,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {20318#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:44,054 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:29:44,054 INFO L273 TraceCheckUtils]: 32: Hoare triple {20319#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:44,055 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:29:44,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {20320#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:44,056 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:29:44,057 INFO L273 TraceCheckUtils]: 36: Hoare triple {20321#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:44,058 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:29:44,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {20322#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:44,059 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:29:44,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {20323#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:44,061 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:29:44,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {20324#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:44,062 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:29:44,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {20325#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:44,064 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:29:44,064 INFO L273 TraceCheckUtils]: 46: Hoare triple {20326#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:44,065 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:29:44,066 INFO L273 TraceCheckUtils]: 48: Hoare triple {20327#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:44,067 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:29:44,067 INFO L273 TraceCheckUtils]: 50: Hoare triple {20328#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:44,068 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:29:44,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {20329#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:44,070 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:29:44,070 INFO L273 TraceCheckUtils]: 54: Hoare triple {20330#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:44,071 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:29:44,072 INFO L273 TraceCheckUtils]: 56: Hoare triple {20331#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:44,072 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:29:44,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {20332#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:29:44,074 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:29:44,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {20333#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:29:44,075 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:29:44,076 INFO L273 TraceCheckUtils]: 62: Hoare triple {20334#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:29:44,077 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:29:44,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {20335#(<= main_~i~1 29)} assume !(~i~1 < 10000); {20305#false} is VALID [2018-11-23 12:29:44,078 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:29:44,078 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:29:44,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,079 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:29:44,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,079 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:29:44,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,080 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:29:44,080 INFO L273 TraceCheckUtils]: 73: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,080 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:29:44,080 INFO L273 TraceCheckUtils]: 75: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,081 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:29:44,081 INFO L273 TraceCheckUtils]: 77: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,081 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:29:44,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,081 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:29:44,082 INFO L273 TraceCheckUtils]: 81: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,082 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:29:44,082 INFO L273 TraceCheckUtils]: 83: Hoare triple {20304#true} assume !(~i~0 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,083 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:29:44,083 INFO L273 TraceCheckUtils]: 85: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,083 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20304#true} {20305#false} #70#return; {20305#false} is VALID [2018-11-23 12:29:44,083 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:29:44,083 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:29:44,084 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:29:44,084 INFO L273 TraceCheckUtils]: 90: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,084 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:29:44,084 INFO L273 TraceCheckUtils]: 92: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,084 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:29:44,085 INFO L273 TraceCheckUtils]: 94: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,085 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:29:44,085 INFO L273 TraceCheckUtils]: 96: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,085 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:29:44,085 INFO L273 TraceCheckUtils]: 98: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,086 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:29:44,086 INFO L273 TraceCheckUtils]: 100: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,086 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:29:44,086 INFO L273 TraceCheckUtils]: 102: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,086 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:29:44,087 INFO L273 TraceCheckUtils]: 104: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,087 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:29:44,087 INFO L273 TraceCheckUtils]: 106: Hoare triple {20304#true} assume !(~i~0 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,087 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:29:44,087 INFO L273 TraceCheckUtils]: 108: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,088 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20304#true} {20305#false} #72#return; {20305#false} is VALID [2018-11-23 12:29:44,088 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:29:44,088 INFO L273 TraceCheckUtils]: 111: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,088 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:29:44,089 INFO L273 TraceCheckUtils]: 113: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,089 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:29:44,089 INFO L273 TraceCheckUtils]: 115: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,089 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:29:44,089 INFO L273 TraceCheckUtils]: 117: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,090 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:29:44,090 INFO L273 TraceCheckUtils]: 119: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,090 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:29:44,090 INFO L273 TraceCheckUtils]: 121: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,090 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:29:44,091 INFO L273 TraceCheckUtils]: 123: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,091 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:29:44,091 INFO L273 TraceCheckUtils]: 125: Hoare triple {20305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,091 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:29:44,091 INFO L273 TraceCheckUtils]: 127: Hoare triple {20305#false} assume !(~i~2 < 9999); {20305#false} is VALID [2018-11-23 12:29:44,092 INFO L273 TraceCheckUtils]: 128: Hoare triple {20305#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20305#false} is VALID [2018-11-23 12:29:44,092 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:29:44,092 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:29:44,092 INFO L273 TraceCheckUtils]: 131: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,092 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:29:44,093 INFO L273 TraceCheckUtils]: 133: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,093 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:29:44,093 INFO L273 TraceCheckUtils]: 135: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,093 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:29:44,093 INFO L273 TraceCheckUtils]: 137: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,094 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:29:44,094 INFO L273 TraceCheckUtils]: 139: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,094 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:29:44,094 INFO L273 TraceCheckUtils]: 141: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,094 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:29:44,095 INFO L273 TraceCheckUtils]: 143: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,095 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:29:44,095 INFO L273 TraceCheckUtils]: 145: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,095 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:29:44,095 INFO L273 TraceCheckUtils]: 147: Hoare triple {20304#true} assume !(~i~0 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,096 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:29:44,096 INFO L273 TraceCheckUtils]: 149: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,096 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20304#true} {20305#false} #74#return; {20305#false} is VALID [2018-11-23 12:29:44,096 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:29:44,096 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:29:44,097 INFO L273 TraceCheckUtils]: 153: Hoare triple {20305#false} assume !false; {20305#false} is VALID [2018-11-23 12:29:44,125 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:29:44,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:44,126 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:29:44,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:44,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:44,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:44,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:44,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {20304#true} call ULTIMATE.init(); {20304#true} is VALID [2018-11-23 12:29:44,643 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:29:44,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20304#true} {20304#true} #66#return; {20304#true} is VALID [2018-11-23 12:29:44,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {20304#true} call #t~ret13 := main(); {20304#true} is VALID [2018-11-23 12:29:44,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {20304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20304#true} is VALID [2018-11-23 12:29:44,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,644 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:29:44,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,645 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:29:44,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,645 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:29:44,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,646 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:29:44,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,646 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:29:44,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,646 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:29:44,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,646 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:29:44,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,647 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:29:44,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,647 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:29:44,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,647 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:29:44,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,647 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:29:44,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,648 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:29:44,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,648 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:29:44,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,648 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:29:44,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,649 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:29:44,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,649 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:29:44,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,649 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:29:44,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,649 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:29:44,649 INFO L273 TraceCheckUtils]: 42: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,650 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:29:44,650 INFO L273 TraceCheckUtils]: 44: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,650 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:29:44,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,650 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:29:44,650 INFO L273 TraceCheckUtils]: 48: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,650 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:29:44,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,651 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:29:44,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,651 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:29:44,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,652 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:29:44,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,652 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:29:44,652 INFO L273 TraceCheckUtils]: 58: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,652 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:29:44,652 INFO L273 TraceCheckUtils]: 60: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,652 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:29:44,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {20304#true} assume !!(~i~1 < 10000);assume -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:29:44,653 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:29:44,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {20304#true} assume !(~i~1 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,653 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:29:44,653 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:29:44,653 INFO L273 TraceCheckUtils]: 67: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,653 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:29:44,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,654 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:29:44,654 INFO L273 TraceCheckUtils]: 71: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,654 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:29:44,654 INFO L273 TraceCheckUtils]: 73: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,654 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:29:44,654 INFO L273 TraceCheckUtils]: 75: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,655 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:29:44,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,655 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:29:44,655 INFO L273 TraceCheckUtils]: 79: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,655 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:29:44,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,655 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:29:44,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {20304#true} assume !(~i~0 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,656 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:29:44,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,656 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {20304#true} {20304#true} #70#return; {20304#true} is VALID [2018-11-23 12:29:44,656 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:29:44,656 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:29:44,656 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:29:44,656 INFO L273 TraceCheckUtils]: 90: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,657 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:29:44,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,657 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:29:44,657 INFO L273 TraceCheckUtils]: 94: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,657 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:29:44,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,657 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:29:44,658 INFO L273 TraceCheckUtils]: 98: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,658 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:29:44,658 INFO L273 TraceCheckUtils]: 100: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,658 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:29:44,658 INFO L273 TraceCheckUtils]: 102: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,658 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:29:44,658 INFO L273 TraceCheckUtils]: 104: Hoare triple {20304#true} assume !!(~i~0 < 10000);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:29:44,658 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:29:44,659 INFO L273 TraceCheckUtils]: 106: Hoare triple {20304#true} assume !(~i~0 < 10000); {20304#true} is VALID [2018-11-23 12:29:44,659 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:29:44,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {20304#true} assume true; {20304#true} is VALID [2018-11-23 12:29:44,659 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {20304#true} {20304#true} #72#return; {20304#true} is VALID [2018-11-23 12:29:44,659 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:29:44,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,659 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:29:44,660 INFO L273 TraceCheckUtils]: 113: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,660 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:29:44,660 INFO L273 TraceCheckUtils]: 115: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,660 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:29:44,660 INFO L273 TraceCheckUtils]: 117: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,660 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:29:44,660 INFO L273 TraceCheckUtils]: 119: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,661 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:29:44,661 INFO L273 TraceCheckUtils]: 121: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,661 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:29:44,661 INFO L273 TraceCheckUtils]: 123: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,661 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:29:44,661 INFO L273 TraceCheckUtils]: 125: Hoare triple {20304#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:29:44,661 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:29:44,661 INFO L273 TraceCheckUtils]: 127: Hoare triple {20304#true} assume !(~i~2 < 9999); {20304#true} is VALID [2018-11-23 12:29:44,662 INFO L273 TraceCheckUtils]: 128: Hoare triple {20304#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20304#true} is VALID [2018-11-23 12:29:44,662 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:29:44,662 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:29:44,663 INFO L273 TraceCheckUtils]: 131: Hoare triple {20729#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:29:44,663 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:29:44,664 INFO L273 TraceCheckUtils]: 133: Hoare triple {20736#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:29:44,664 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:29:44,665 INFO L273 TraceCheckUtils]: 135: Hoare triple {20743#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:29:44,665 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:29:44,665 INFO L273 TraceCheckUtils]: 137: Hoare triple {20750#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:29:44,666 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:29:44,667 INFO L273 TraceCheckUtils]: 139: Hoare triple {20757#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:29:44,668 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:29:44,668 INFO L273 TraceCheckUtils]: 141: Hoare triple {20764#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:29:44,669 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:29:44,670 INFO L273 TraceCheckUtils]: 143: Hoare triple {20771#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:29:44,671 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:29:44,671 INFO L273 TraceCheckUtils]: 145: Hoare triple {20778#(<= xor_~i~0 8)} assume !!(~i~0 < 10000);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:29:44,672 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:29:44,673 INFO L273 TraceCheckUtils]: 147: Hoare triple {20785#(<= xor_~i~0 9)} assume !(~i~0 < 10000); {20305#false} is VALID [2018-11-23 12:29:44,673 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:29:44,673 INFO L273 TraceCheckUtils]: 149: Hoare triple {20305#false} assume true; {20305#false} is VALID [2018-11-23 12:29:44,673 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {20305#false} {20304#true} #74#return; {20305#false} is VALID [2018-11-23 12:29:44,674 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:29:44,674 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:29:44,674 INFO L273 TraceCheckUtils]: 153: Hoare triple {20305#false} assume !false; {20305#false} is VALID [2018-11-23 12:29:44,697 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:29:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2018-11-23 12:29:44,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:29:44,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:44,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:29:44,860 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:29:44,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:29:44,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:29:44,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:29:44,862 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2018-11-23 12:29:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:46,266 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2018-11-23 12:29:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:29:46,266 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-11-23 12:29:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:29:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:29:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:29:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:29:46,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 134 transitions. [2018-11-23 12:29:46,414 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:29:46,417 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:29:46,417 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 12:29:46,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:29:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 12:29:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 12:29:46,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:46,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 12:29:46,482 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 12:29:46,483 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 12:29:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:46,486 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:29:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:29:46,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:46,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:46,487 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 12:29:46,487 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 12:29:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:46,489 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-11-23 12:29:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:29:46,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:46,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:46,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:46,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:29:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-23 12:29:46,493 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2018-11-23 12:29:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:46,493 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-23 12:29:46,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:29:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:29:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 12:29:46,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:46,494 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:29:46,495 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:46,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 921802629, now seen corresponding path program 29 times [2018-11-23 12:29:46,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:46,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:46,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:46,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:47,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {21466#true} call ULTIMATE.init(); {21466#true} is VALID [2018-11-23 12:29:47,907 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:47,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:29:47,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21466#true} {21466#true} #66#return; {21466#true} is VALID [2018-11-23 12:29:47,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {21466#true} call #t~ret13 := main(); {21466#true} is VALID [2018-11-23 12:29:47,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {21466#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:29:47,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {21468#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:29:47,909 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:29:47,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {21469#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:29:47,910 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:29:47,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {21470#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:29:47,911 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:29:47,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {21471#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:29:47,912 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:29:47,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {21472#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:29:47,913 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:29:47,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {21473#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:29:47,914 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:29:47,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {21474#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:29:47,915 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:29:47,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {21475#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:29:47,916 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:29:47,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {21476#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:29:47,918 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:29:47,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {21477#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:29:47,919 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:29:47,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {21478#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:29:47,920 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:29:47,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {21479#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:29:47,921 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:29:47,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {21480#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:29:47,923 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:29:47,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {21481#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:29:47,924 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:29:47,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {21482#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:29:47,925 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:29:47,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {21483#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:29:47,926 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:29:47,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {21484#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:29:47,927 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:29:47,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {21485#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:29:47,929 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:29:47,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {21486#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:29:47,930 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:29:47,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {21487#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:29:47,931 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:29:47,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {21488#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:29:47,932 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:29:47,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {21489#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:29:47,934 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:29:47,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {21490#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:29:47,935 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:29:47,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {21491#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:29:47,936 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:29:47,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {21492#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:29:47,937 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:29:47,938 INFO L273 TraceCheckUtils]: 56: Hoare triple {21493#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:29:47,939 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:29:47,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {21494#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:29:47,940 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:29:47,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {21495#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:29:47,941 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:29:47,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {21496#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:29:47,942 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:29:47,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {21497#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:29:47,944 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:29:47,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {21498#(<= main_~i~1 30)} assume !(~i~1 < 10000); {21467#false} is VALID [2018-11-23 12:29:47,944 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:29:47,945 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:29:47,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,945 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:29:47,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,945 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:29:47,946 INFO L273 TraceCheckUtils]: 73: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,946 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:29:47,946 INFO L273 TraceCheckUtils]: 75: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,946 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:29:47,946 INFO L273 TraceCheckUtils]: 77: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,946 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:29:47,947 INFO L273 TraceCheckUtils]: 79: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,947 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:29:47,947 INFO L273 TraceCheckUtils]: 81: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,947 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:29:47,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,947 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:29:47,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,947 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:29:47,947 INFO L273 TraceCheckUtils]: 87: Hoare triple {21466#true} assume !(~i~0 < 10000); {21466#true} is VALID [2018-11-23 12:29:47,948 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:29:47,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:29:47,948 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21466#true} {21467#false} #70#return; {21467#false} is VALID [2018-11-23 12:29:47,948 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:47,948 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:29:47,948 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:29:47,948 INFO L273 TraceCheckUtils]: 94: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,948 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:29:47,948 INFO L273 TraceCheckUtils]: 96: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,949 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:29:47,949 INFO L273 TraceCheckUtils]: 98: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,949 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:29:47,949 INFO L273 TraceCheckUtils]: 100: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,949 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:29:47,949 INFO L273 TraceCheckUtils]: 102: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,949 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:29:47,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,949 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:29:47,949 INFO L273 TraceCheckUtils]: 106: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,950 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:29:47,950 INFO L273 TraceCheckUtils]: 108: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,950 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:29:47,950 INFO L273 TraceCheckUtils]: 110: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,950 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:29:47,950 INFO L273 TraceCheckUtils]: 112: Hoare triple {21466#true} assume !(~i~0 < 10000); {21466#true} is VALID [2018-11-23 12:29:47,950 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:29:47,950 INFO L273 TraceCheckUtils]: 114: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:29:47,950 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21466#true} {21467#false} #72#return; {21467#false} is VALID [2018-11-23 12:29:47,950 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:47,951 INFO L273 TraceCheckUtils]: 117: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,951 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:47,951 INFO L273 TraceCheckUtils]: 119: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,951 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:47,951 INFO L273 TraceCheckUtils]: 121: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,951 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:47,951 INFO L273 TraceCheckUtils]: 123: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,951 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:47,951 INFO L273 TraceCheckUtils]: 125: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,951 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:47,952 INFO L273 TraceCheckUtils]: 127: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,952 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:47,952 INFO L273 TraceCheckUtils]: 129: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,952 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:47,952 INFO L273 TraceCheckUtils]: 131: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:47,952 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:47,952 INFO L273 TraceCheckUtils]: 133: Hoare triple {21467#false} assume !(~i~2 < 9999); {21467#false} is VALID [2018-11-23 12:29:47,952 INFO L273 TraceCheckUtils]: 134: Hoare triple {21467#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:29:47,952 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:29:47,953 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:29:47,953 INFO L273 TraceCheckUtils]: 137: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,953 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:29:47,953 INFO L273 TraceCheckUtils]: 139: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,953 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:29:47,953 INFO L273 TraceCheckUtils]: 141: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,953 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:29:47,953 INFO L273 TraceCheckUtils]: 143: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,953 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:29:47,953 INFO L273 TraceCheckUtils]: 145: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,954 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:29:47,954 INFO L273 TraceCheckUtils]: 147: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,954 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:29:47,954 INFO L273 TraceCheckUtils]: 149: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,954 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:29:47,954 INFO L273 TraceCheckUtils]: 151: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,954 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:29:47,954 INFO L273 TraceCheckUtils]: 153: Hoare triple {21466#true} assume !!(~i~0 < 10000);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:29:47,954 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:29:47,954 INFO L273 TraceCheckUtils]: 155: Hoare triple {21466#true} assume !(~i~0 < 10000); {21466#true} is VALID [2018-11-23 12:29:47,955 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:29:47,955 INFO L273 TraceCheckUtils]: 157: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:29:47,955 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21466#true} {21467#false} #74#return; {21467#false} is VALID [2018-11-23 12:29:47,955 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:47,955 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:47,955 INFO L273 TraceCheckUtils]: 161: Hoare triple {21467#false} assume !false; {21467#false} is VALID [2018-11-23 12:29:47,967 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:29:47,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:47,968 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:29:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:19,431 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:30:19,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:19,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:19,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {21466#true} call ULTIMATE.init(); {21466#true} is VALID [2018-11-23 12:30:19,814 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:30:19,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {21466#true} assume true; {21466#true} is VALID [2018-11-23 12:30:19,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21466#true} {21466#true} #66#return; {21466#true} is VALID [2018-11-23 12:30:19,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {21466#true} call #t~ret13 := main(); {21466#true} is VALID [2018-11-23 12:30:19,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {21466#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21466#true} is VALID [2018-11-23 12:30:19,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,815 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:30:19,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,816 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:30:19,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,816 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:30:19,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,816 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:30:19,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,817 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:30:19,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,817 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:30:19,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,817 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:30:19,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,817 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:30:19,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,818 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:30:19,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,818 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:30:19,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,818 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:30:19,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,818 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:30:19,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,818 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:30:19,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,819 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:30:19,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,819 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:30:19,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,819 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:30:19,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,819 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:30:19,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,820 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:30:19,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,820 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:30:19,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,820 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:30:19,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,821 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:30:19,821 INFO L273 TraceCheckUtils]: 48: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,821 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:30:19,821 INFO L273 TraceCheckUtils]: 50: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,821 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:30:19,821 INFO L273 TraceCheckUtils]: 52: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,821 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:30:19,821 INFO L273 TraceCheckUtils]: 54: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,821 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:30:19,822 INFO L273 TraceCheckUtils]: 56: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,822 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:30:19,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,822 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:30:19,822 INFO L273 TraceCheckUtils]: 60: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,822 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:30:19,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,822 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:30:19,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {21466#true} assume !!(~i~1 < 10000);assume -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:30:19,823 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:30:19,823 INFO L273 TraceCheckUtils]: 66: Hoare triple {21466#true} assume !(~i~1 < 10000); {21466#true} is VALID [2018-11-23 12:30:19,823 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:30:19,823 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:30:19,824 INFO L273 TraceCheckUtils]: 69: Hoare triple {21706#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:30:19,824 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:30:19,824 INFO L273 TraceCheckUtils]: 71: Hoare triple {21713#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:30:19,825 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:30:19,825 INFO L273 TraceCheckUtils]: 73: Hoare triple {21720#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:30:19,826 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:30:19,826 INFO L273 TraceCheckUtils]: 75: Hoare triple {21727#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:30:19,826 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:30:19,827 INFO L273 TraceCheckUtils]: 77: Hoare triple {21734#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:30:19,827 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:30:19,828 INFO L273 TraceCheckUtils]: 79: Hoare triple {21741#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:30:19,828 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:30:19,829 INFO L273 TraceCheckUtils]: 81: Hoare triple {21748#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:30:19,830 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:30:19,830 INFO L273 TraceCheckUtils]: 83: Hoare triple {21755#(<= xor_~i~0 8)} assume !!(~i~0 < 10000);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:30:19,831 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:30:19,831 INFO L273 TraceCheckUtils]: 85: Hoare triple {21762#(<= xor_~i~0 9)} assume !!(~i~0 < 10000);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:30:19,832 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:30:19,833 INFO L273 TraceCheckUtils]: 87: Hoare triple {21769#(<= xor_~i~0 10)} assume !(~i~0 < 10000); {21467#false} is VALID [2018-11-23 12:30:19,833 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:30:19,833 INFO L273 TraceCheckUtils]: 89: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:30:19,833 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {21467#false} {21466#true} #70#return; {21467#false} is VALID [2018-11-23 12:30:19,834 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:30:19,834 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:30:19,834 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:30:19,834 INFO L273 TraceCheckUtils]: 94: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,834 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:30:19,835 INFO L273 TraceCheckUtils]: 96: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,835 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:30:19,835 INFO L273 TraceCheckUtils]: 98: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,835 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:30:19,835 INFO L273 TraceCheckUtils]: 100: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,835 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:30:19,836 INFO L273 TraceCheckUtils]: 102: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,836 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:30:19,836 INFO L273 TraceCheckUtils]: 104: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,836 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:30:19,836 INFO L273 TraceCheckUtils]: 106: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,836 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:30:19,837 INFO L273 TraceCheckUtils]: 108: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,837 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:30:19,837 INFO L273 TraceCheckUtils]: 110: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,837 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:30:19,837 INFO L273 TraceCheckUtils]: 112: Hoare triple {21467#false} assume !(~i~0 < 10000); {21467#false} is VALID [2018-11-23 12:30:19,838 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:30:19,838 INFO L273 TraceCheckUtils]: 114: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:30:19,838 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21467#false} {21467#false} #72#return; {21467#false} is VALID [2018-11-23 12:30:19,838 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:30:19,838 INFO L273 TraceCheckUtils]: 117: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,838 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:30:19,838 INFO L273 TraceCheckUtils]: 119: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,838 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:30:19,839 INFO L273 TraceCheckUtils]: 121: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,839 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:30:19,839 INFO L273 TraceCheckUtils]: 123: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,839 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:30:19,839 INFO L273 TraceCheckUtils]: 125: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,839 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:30:19,839 INFO L273 TraceCheckUtils]: 127: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,839 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:30:19,839 INFO L273 TraceCheckUtils]: 129: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,839 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:30:19,840 INFO L273 TraceCheckUtils]: 131: Hoare triple {21467#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:19,840 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:30:19,840 INFO L273 TraceCheckUtils]: 133: Hoare triple {21467#false} assume !(~i~2 < 9999); {21467#false} is VALID [2018-11-23 12:30:19,840 INFO L273 TraceCheckUtils]: 134: Hoare triple {21467#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21467#false} is VALID [2018-11-23 12:30:19,840 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:30:19,840 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:30:19,840 INFO L273 TraceCheckUtils]: 137: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,840 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:30:19,840 INFO L273 TraceCheckUtils]: 139: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,840 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:30:19,841 INFO L273 TraceCheckUtils]: 141: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,841 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:30:19,841 INFO L273 TraceCheckUtils]: 143: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,841 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:30:19,841 INFO L273 TraceCheckUtils]: 145: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,841 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:30:19,841 INFO L273 TraceCheckUtils]: 147: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,841 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:30:19,841 INFO L273 TraceCheckUtils]: 149: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,841 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:30:19,842 INFO L273 TraceCheckUtils]: 151: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,842 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:30:19,842 INFO L273 TraceCheckUtils]: 153: Hoare triple {21467#false} assume !!(~i~0 < 10000);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:30:19,842 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:30:19,842 INFO L273 TraceCheckUtils]: 155: Hoare triple {21467#false} assume !(~i~0 < 10000); {21467#false} is VALID [2018-11-23 12:30:19,842 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:30:19,842 INFO L273 TraceCheckUtils]: 157: Hoare triple {21467#false} assume true; {21467#false} is VALID [2018-11-23 12:30:19,842 INFO L268 TraceCheckUtils]: 158: Hoare quadruple {21467#false} {21467#false} #74#return; {21467#false} is VALID [2018-11-23 12:30:19,842 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:30:19,843 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:30:19,843 INFO L273 TraceCheckUtils]: 161: Hoare triple {21467#false} assume !false; {21467#false} is VALID [2018-11-23 12:30:19,852 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:30:19,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:19,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2018-11-23 12:30:19,881 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:30:19,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:19,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:30:20,037 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:30:20,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:30:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:30:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:20,039 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2018-11-23 12:30:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:21,075 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-11-23 12:30:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:30:21,075 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-11-23 12:30:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:30:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 138 transitions. [2018-11-23 12:30:21,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 138 transitions. [2018-11-23 12:30:21,208 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:30:21,211 INFO L225 Difference]: With dead ends: 173 [2018-11-23 12:30:21,211 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:30:21,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:30:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-23 12:30:21,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:21,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 121 states. [2018-11-23 12:30:21,329 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 121 states. [2018-11-23 12:30:21,329 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 121 states. [2018-11-23 12:30:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:21,331 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:30:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:30:21,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:21,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:21,332 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 123 states. [2018-11-23 12:30:21,333 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 123 states. [2018-11-23 12:30:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:21,335 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-23 12:30:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:30:21,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:21,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:21,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:21,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:30:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-11-23 12:30:21,338 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2018-11-23 12:30:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:21,338 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-11-23 12:30:21,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:30:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:30:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-23 12:30:21,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:21,339 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:30:21,340 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 301043269, now seen corresponding path program 30 times [2018-11-23 12:30:21,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:21,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:22,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {22677#true} call ULTIMATE.init(); {22677#true} is VALID [2018-11-23 12:30:22,562 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:30:22,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:22,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22677#true} {22677#true} #66#return; {22677#true} is VALID [2018-11-23 12:30:22,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {22677#true} call #t~ret13 := main(); {22677#true} is VALID [2018-11-23 12:30:22,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {22677#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:22,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {22679#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:22,564 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:30:22,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {22680#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:22,564 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:30:22,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {22681#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:22,565 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:30:22,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {22682#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:22,566 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:30:22,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {22683#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:22,567 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:30:22,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {22684#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:22,568 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:30:22,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {22685#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:22,569 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:30:22,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {22686#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:22,571 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:30:22,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {22687#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:22,572 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:30:22,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {22688#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:22,573 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:30:22,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {22689#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:22,574 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:30:22,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {22690#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:22,576 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:30:22,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {22691#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:22,577 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:30:22,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {22692#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:22,578 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:30:22,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {22693#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:22,579 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:30:22,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {22694#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:22,581 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:30:22,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {22695#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:22,582 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:30:22,582 INFO L273 TraceCheckUtils]: 40: Hoare triple {22696#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:22,583 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:30:22,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {22697#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:22,584 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:30:22,585 INFO L273 TraceCheckUtils]: 44: Hoare triple {22698#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:22,585 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:30:22,586 INFO L273 TraceCheckUtils]: 46: Hoare triple {22699#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:22,587 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:30:22,587 INFO L273 TraceCheckUtils]: 48: Hoare triple {22700#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:22,588 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:30:22,588 INFO L273 TraceCheckUtils]: 50: Hoare triple {22701#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:22,589 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:30:22,590 INFO L273 TraceCheckUtils]: 52: Hoare triple {22702#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:22,590 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:30:22,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {22703#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:22,592 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:30:22,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {22704#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:22,593 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:30:22,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {22705#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:22,594 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:30:22,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {22706#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:22,595 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:30:22,596 INFO L273 TraceCheckUtils]: 62: Hoare triple {22707#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:22,597 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:30:22,597 INFO L273 TraceCheckUtils]: 64: Hoare triple {22708#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:22,598 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:30:22,598 INFO L273 TraceCheckUtils]: 66: Hoare triple {22709#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:22,599 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:30:22,600 INFO L273 TraceCheckUtils]: 68: Hoare triple {22710#(<= main_~i~1 31)} assume !(~i~1 < 10000); {22678#false} is VALID [2018-11-23 12:30:22,600 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:30:22,600 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:30:22,600 INFO L273 TraceCheckUtils]: 71: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,600 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:30:22,601 INFO L273 TraceCheckUtils]: 73: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,601 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:30:22,601 INFO L273 TraceCheckUtils]: 75: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,601 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:30:22,601 INFO L273 TraceCheckUtils]: 77: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,601 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:30:22,602 INFO L273 TraceCheckUtils]: 79: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,602 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:30:22,602 INFO L273 TraceCheckUtils]: 81: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,602 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:30:22,602 INFO L273 TraceCheckUtils]: 83: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,603 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:30:22,603 INFO L273 TraceCheckUtils]: 85: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,603 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:30:22,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,603 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:30:22,603 INFO L273 TraceCheckUtils]: 89: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,603 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:30:22,604 INFO L273 TraceCheckUtils]: 91: Hoare triple {22677#true} assume !(~i~0 < 10000); {22677#true} is VALID [2018-11-23 12:30:22,604 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:30:22,604 INFO L273 TraceCheckUtils]: 93: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:22,604 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22677#true} {22678#false} #70#return; {22678#false} is VALID [2018-11-23 12:30:22,604 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:30:22,604 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:30:22,604 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:30:22,604 INFO L273 TraceCheckUtils]: 98: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,604 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:30:22,604 INFO L273 TraceCheckUtils]: 100: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,605 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:30:22,605 INFO L273 TraceCheckUtils]: 102: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,605 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:30:22,605 INFO L273 TraceCheckUtils]: 104: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,605 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:30:22,605 INFO L273 TraceCheckUtils]: 106: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,605 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:30:22,605 INFO L273 TraceCheckUtils]: 108: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,605 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:30:22,605 INFO L273 TraceCheckUtils]: 110: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,606 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:30:22,606 INFO L273 TraceCheckUtils]: 112: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,606 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:30:22,606 INFO L273 TraceCheckUtils]: 114: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,606 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:30:22,606 INFO L273 TraceCheckUtils]: 116: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,606 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:30:22,606 INFO L273 TraceCheckUtils]: 118: Hoare triple {22677#true} assume !(~i~0 < 10000); {22677#true} is VALID [2018-11-23 12:30:22,606 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:30:22,607 INFO L273 TraceCheckUtils]: 120: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:22,607 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22677#true} {22678#false} #72#return; {22678#false} is VALID [2018-11-23 12:30:22,607 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:30:22,607 INFO L273 TraceCheckUtils]: 123: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,607 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:30:22,607 INFO L273 TraceCheckUtils]: 125: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,607 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:30:22,607 INFO L273 TraceCheckUtils]: 127: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,607 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:30:22,607 INFO L273 TraceCheckUtils]: 129: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,608 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:30:22,608 INFO L273 TraceCheckUtils]: 131: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,608 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:30:22,608 INFO L273 TraceCheckUtils]: 133: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,608 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:30:22,608 INFO L273 TraceCheckUtils]: 135: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,608 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:30:22,608 INFO L273 TraceCheckUtils]: 137: Hoare triple {22678#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:22,608 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:30:22,608 INFO L273 TraceCheckUtils]: 139: Hoare triple {22678#false} assume !(~i~2 < 9999); {22678#false} is VALID [2018-11-23 12:30:22,609 INFO L273 TraceCheckUtils]: 140: Hoare triple {22678#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22678#false} is VALID [2018-11-23 12:30:22,609 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:30:22,609 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:30:22,609 INFO L273 TraceCheckUtils]: 143: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,609 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:30:22,609 INFO L273 TraceCheckUtils]: 145: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,609 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:30:22,609 INFO L273 TraceCheckUtils]: 147: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,609 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:30:22,609 INFO L273 TraceCheckUtils]: 149: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,610 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:30:22,610 INFO L273 TraceCheckUtils]: 151: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,610 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:30:22,610 INFO L273 TraceCheckUtils]: 153: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,610 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:30:22,610 INFO L273 TraceCheckUtils]: 155: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,610 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:30:22,610 INFO L273 TraceCheckUtils]: 157: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,610 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:30:22,611 INFO L273 TraceCheckUtils]: 159: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,611 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:30:22,611 INFO L273 TraceCheckUtils]: 161: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:22,611 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:30:22,611 INFO L273 TraceCheckUtils]: 163: Hoare triple {22677#true} assume !(~i~0 < 10000); {22677#true} is VALID [2018-11-23 12:30:22,611 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:30:22,611 INFO L273 TraceCheckUtils]: 165: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:22,611 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22677#true} {22678#false} #74#return; {22678#false} is VALID [2018-11-23 12:30:22,611 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:30:22,611 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:30:22,612 INFO L273 TraceCheckUtils]: 169: Hoare triple {22678#false} assume !false; {22678#false} is VALID [2018-11-23 12:30:22,625 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:30:22,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:22,626 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:30:22,635 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:24,659 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:30:24,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:24,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:25,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {22677#true} call ULTIMATE.init(); {22677#true} is VALID [2018-11-23 12:30:25,320 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:30:25,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:25,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22677#true} {22677#true} #66#return; {22677#true} is VALID [2018-11-23 12:30:25,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {22677#true} call #t~ret13 := main(); {22677#true} is VALID [2018-11-23 12:30:25,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {22677#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22677#true} is VALID [2018-11-23 12:30:25,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,321 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:30:25,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,321 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:30:25,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,322 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:30:25,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,322 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:30:25,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,322 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:30:25,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,322 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:30:25,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,322 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:30:25,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,323 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:30:25,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,323 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:30:25,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,323 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:30:25,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,323 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:30:25,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,323 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:30:25,324 INFO L273 TraceCheckUtils]: 30: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,324 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:30:25,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,324 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:30:25,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,324 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:30:25,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,324 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:30:25,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,325 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:30:25,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,325 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:30:25,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,325 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:30:25,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,325 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:30:25,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,325 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:30:25,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,326 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:30:25,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,326 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:30:25,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,326 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:30:25,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,326 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:30:25,326 INFO L273 TraceCheckUtils]: 56: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,326 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:30:25,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,327 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:30:25,327 INFO L273 TraceCheckUtils]: 60: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,327 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:30:25,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,327 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:30:25,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,327 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:30:25,327 INFO L273 TraceCheckUtils]: 66: Hoare triple {22677#true} assume !!(~i~1 < 10000);assume -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:30:25,327 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:30:25,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {22677#true} assume !(~i~1 < 10000); {22677#true} is VALID [2018-11-23 12:30:25,328 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:30:25,328 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:30:25,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,328 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:30:25,328 INFO L273 TraceCheckUtils]: 73: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,328 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:30:25,328 INFO L273 TraceCheckUtils]: 75: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,328 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:30:25,328 INFO L273 TraceCheckUtils]: 77: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,329 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:30:25,329 INFO L273 TraceCheckUtils]: 79: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,329 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:30:25,329 INFO L273 TraceCheckUtils]: 81: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,329 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:30:25,329 INFO L273 TraceCheckUtils]: 83: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,329 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:30:25,329 INFO L273 TraceCheckUtils]: 85: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,329 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:30:25,329 INFO L273 TraceCheckUtils]: 87: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,330 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:30:25,330 INFO L273 TraceCheckUtils]: 89: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,330 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:30:25,330 INFO L273 TraceCheckUtils]: 91: Hoare triple {22677#true} assume !(~i~0 < 10000); {22677#true} is VALID [2018-11-23 12:30:25,330 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:30:25,330 INFO L273 TraceCheckUtils]: 93: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:25,330 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {22677#true} {22677#true} #70#return; {22677#true} is VALID [2018-11-23 12:30:25,330 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:30:25,330 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:30:25,331 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:30:25,331 INFO L273 TraceCheckUtils]: 98: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,331 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:30:25,331 INFO L273 TraceCheckUtils]: 100: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,331 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:30:25,331 INFO L273 TraceCheckUtils]: 102: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,331 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:30:25,331 INFO L273 TraceCheckUtils]: 104: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,331 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:30:25,331 INFO L273 TraceCheckUtils]: 106: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,332 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:30:25,332 INFO L273 TraceCheckUtils]: 108: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,332 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:30:25,332 INFO L273 TraceCheckUtils]: 110: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,332 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:30:25,332 INFO L273 TraceCheckUtils]: 112: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,332 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:30:25,332 INFO L273 TraceCheckUtils]: 114: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,332 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:30:25,332 INFO L273 TraceCheckUtils]: 116: Hoare triple {22677#true} assume !!(~i~0 < 10000);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:30:25,333 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:30:25,333 INFO L273 TraceCheckUtils]: 118: Hoare triple {22677#true} assume !(~i~0 < 10000); {22677#true} is VALID [2018-11-23 12:30:25,333 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:30:25,333 INFO L273 TraceCheckUtils]: 120: Hoare triple {22677#true} assume true; {22677#true} is VALID [2018-11-23 12:30:25,333 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {22677#true} {22677#true} #72#return; {22677#true} is VALID [2018-11-23 12:30:25,334 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:30:25,334 INFO L273 TraceCheckUtils]: 123: Hoare triple {23080#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,334 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:30:25,335 INFO L273 TraceCheckUtils]: 125: Hoare triple {23087#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,335 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:30:25,336 INFO L273 TraceCheckUtils]: 127: Hoare triple {23094#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,336 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:30:25,336 INFO L273 TraceCheckUtils]: 129: Hoare triple {23101#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,337 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:30:25,337 INFO L273 TraceCheckUtils]: 131: Hoare triple {23108#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,338 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:30:25,338 INFO L273 TraceCheckUtils]: 133: Hoare triple {23115#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,339 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:30:25,339 INFO L273 TraceCheckUtils]: 135: Hoare triple {23122#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,340 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:30:25,341 INFO L273 TraceCheckUtils]: 137: Hoare triple {23129#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:25,341 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:30:25,342 INFO L273 TraceCheckUtils]: 139: Hoare triple {23136#(<= main_~i~2 8)} assume !(~i~2 < 9999); {22678#false} is VALID [2018-11-23 12:30:25,342 INFO L273 TraceCheckUtils]: 140: Hoare triple {22678#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22678#false} is VALID [2018-11-23 12:30:25,342 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:30:25,343 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:30:25,343 INFO L273 TraceCheckUtils]: 143: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,343 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:30:25,343 INFO L273 TraceCheckUtils]: 145: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,343 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:30:25,343 INFO L273 TraceCheckUtils]: 147: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,344 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:30:25,344 INFO L273 TraceCheckUtils]: 149: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,344 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:30:25,344 INFO L273 TraceCheckUtils]: 151: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,344 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:30:25,344 INFO L273 TraceCheckUtils]: 153: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,345 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:30:25,345 INFO L273 TraceCheckUtils]: 155: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,345 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:30:25,345 INFO L273 TraceCheckUtils]: 157: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,345 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:30:25,346 INFO L273 TraceCheckUtils]: 159: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,346 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:30:25,346 INFO L273 TraceCheckUtils]: 161: Hoare triple {22678#false} assume !!(~i~0 < 10000);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:30:25,346 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:30:25,346 INFO L273 TraceCheckUtils]: 163: Hoare triple {22678#false} assume !(~i~0 < 10000); {22678#false} is VALID [2018-11-23 12:30:25,346 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:30:25,347 INFO L273 TraceCheckUtils]: 165: Hoare triple {22678#false} assume true; {22678#false} is VALID [2018-11-23 12:30:25,347 INFO L268 TraceCheckUtils]: 166: Hoare quadruple {22678#false} {22678#false} #74#return; {22678#false} is VALID [2018-11-23 12:30:25,347 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:30:25,347 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:30:25,347 INFO L273 TraceCheckUtils]: 169: Hoare triple {22678#false} assume !false; {22678#false} is VALID [2018-11-23 12:30:25,358 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:30:25,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:25,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2018-11-23 12:30:25,379 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:30:25,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:25,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:30:25,509 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:30:25,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:30:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:30:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:25,511 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2018-11-23 12:30:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:26,784 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-11-23 12:30:26,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:30:26,784 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-23 12:30:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:30:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:30:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 135 transitions. [2018-11-23 12:30:26,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 135 transitions. [2018-11-23 12:30:26,916 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:30:26,921 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:30:26,921 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:30:26,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:30:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:30:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-23 12:30:27,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:27,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 125 states. [2018-11-23 12:30:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 125 states. [2018-11-23 12:30:27,046 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 125 states. [2018-11-23 12:30:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:27,049 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:30:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:30:27,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:27,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:27,050 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 127 states. [2018-11-23 12:30:27,050 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 127 states. [2018-11-23 12:30:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:27,052 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-23 12:30:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:30:27,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:27,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:27,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:27,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:30:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:30:27,056 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2018-11-23 12:30:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:27,056 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:30:27,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:30:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:30:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:30:27,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:27,057 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:30:27,057 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:27,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 31 times [2018-11-23 12:30:27,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:27,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:27,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {23935#true} call ULTIMATE.init(); {23935#true} is VALID [2018-11-23 12:30:27,855 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:30:27,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:30:27,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23935#true} {23935#true} #66#return; {23935#true} is VALID [2018-11-23 12:30:27,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {23935#true} call #t~ret13 := main(); {23935#true} is VALID [2018-11-23 12:30:27,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {23935#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:27,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {23937#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:27,857 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:30:27,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {23938#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:27,859 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:30:27,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {23939#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:27,860 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:30:27,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {23940#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:27,861 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:30:27,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {23941#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:27,862 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:30:27,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {23942#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:27,863 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:30:27,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {23943#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:27,864 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:30:27,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {23944#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:27,865 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:30:27,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {23945#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:27,867 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:30:27,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {23946#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:27,868 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:30:27,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {23947#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:27,869 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:30:27,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {23948#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:27,870 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:30:27,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {23949#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:27,871 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:30:27,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {23950#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:27,872 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:30:27,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {23951#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:27,874 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:30:27,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {23952#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:27,875 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:30:27,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {23953#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:27,876 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:30:27,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {23954#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:27,877 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:30:27,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {23955#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:27,878 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:30:27,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {23956#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:27,879 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:30:27,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {23957#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:27,881 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:30:27,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {23958#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:27,882 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:30:27,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {23959#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:27,883 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:30:27,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {23960#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:27,884 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:30:27,885 INFO L273 TraceCheckUtils]: 54: Hoare triple {23961#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:27,885 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:30:27,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {23962#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:27,886 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:30:27,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {23963#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:27,887 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:30:27,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {23964#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:27,889 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:30:27,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {23965#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:27,890 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:30:27,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {23966#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:27,891 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:30:27,892 INFO L273 TraceCheckUtils]: 66: Hoare triple {23967#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:27,892 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:30:27,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {23968#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:27,893 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:30:27,894 INFO L273 TraceCheckUtils]: 70: Hoare triple {23969#(<= main_~i~1 32)} assume !(~i~1 < 10000); {23936#false} is VALID [2018-11-23 12:30:27,894 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:30:27,894 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:30:27,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,895 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:30:27,895 INFO L273 TraceCheckUtils]: 75: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,895 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:30:27,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,895 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:30:27,896 INFO L273 TraceCheckUtils]: 79: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,896 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:30:27,896 INFO L273 TraceCheckUtils]: 81: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,896 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:30:27,896 INFO L273 TraceCheckUtils]: 83: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,896 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:30:27,897 INFO L273 TraceCheckUtils]: 85: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,897 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:30:27,897 INFO L273 TraceCheckUtils]: 87: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,897 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:30:27,897 INFO L273 TraceCheckUtils]: 89: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,897 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:30:27,897 INFO L273 TraceCheckUtils]: 91: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,897 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:30:27,897 INFO L273 TraceCheckUtils]: 93: Hoare triple {23935#true} assume !(~i~0 < 10000); {23935#true} is VALID [2018-11-23 12:30:27,897 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:30:27,898 INFO L273 TraceCheckUtils]: 95: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:30:27,898 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23935#true} {23936#false} #70#return; {23936#false} is VALID [2018-11-23 12:30:27,898 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:30:27,898 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:30:27,898 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:30:27,898 INFO L273 TraceCheckUtils]: 100: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,898 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:30:27,898 INFO L273 TraceCheckUtils]: 102: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,898 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:30:27,898 INFO L273 TraceCheckUtils]: 104: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,899 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:30:27,899 INFO L273 TraceCheckUtils]: 106: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,899 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:30:27,899 INFO L273 TraceCheckUtils]: 108: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,899 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:30:27,899 INFO L273 TraceCheckUtils]: 110: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,899 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:30:27,899 INFO L273 TraceCheckUtils]: 112: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,899 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:30:27,900 INFO L273 TraceCheckUtils]: 114: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,900 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:30:27,900 INFO L273 TraceCheckUtils]: 116: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,900 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:30:27,900 INFO L273 TraceCheckUtils]: 118: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,900 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:30:27,900 INFO L273 TraceCheckUtils]: 120: Hoare triple {23935#true} assume !(~i~0 < 10000); {23935#true} is VALID [2018-11-23 12:30:27,900 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:30:27,900 INFO L273 TraceCheckUtils]: 122: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:30:27,900 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23935#true} {23936#false} #72#return; {23936#false} is VALID [2018-11-23 12:30:27,901 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:30:27,901 INFO L273 TraceCheckUtils]: 125: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,901 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:30:27,901 INFO L273 TraceCheckUtils]: 127: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,901 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:30:27,901 INFO L273 TraceCheckUtils]: 129: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,901 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:30:27,901 INFO L273 TraceCheckUtils]: 131: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,901 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:30:27,901 INFO L273 TraceCheckUtils]: 133: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,902 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:30:27,902 INFO L273 TraceCheckUtils]: 135: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,902 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:30:27,902 INFO L273 TraceCheckUtils]: 137: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,902 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:30:27,902 INFO L273 TraceCheckUtils]: 139: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,902 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:30:27,902 INFO L273 TraceCheckUtils]: 141: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:27,902 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:30:27,903 INFO L273 TraceCheckUtils]: 143: Hoare triple {23936#false} assume !(~i~2 < 9999); {23936#false} is VALID [2018-11-23 12:30:27,903 INFO L273 TraceCheckUtils]: 144: Hoare triple {23936#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:30:27,903 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:30:27,903 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:30:27,903 INFO L273 TraceCheckUtils]: 147: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,903 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:30:27,903 INFO L273 TraceCheckUtils]: 149: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,903 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:30:27,903 INFO L273 TraceCheckUtils]: 151: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,903 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:30:27,904 INFO L273 TraceCheckUtils]: 153: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,904 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:30:27,904 INFO L273 TraceCheckUtils]: 155: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,904 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:30:27,904 INFO L273 TraceCheckUtils]: 157: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,904 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:30:27,904 INFO L273 TraceCheckUtils]: 159: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,904 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:30:27,904 INFO L273 TraceCheckUtils]: 161: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,904 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:30:27,905 INFO L273 TraceCheckUtils]: 163: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,905 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:30:27,905 INFO L273 TraceCheckUtils]: 165: Hoare triple {23935#true} assume !!(~i~0 < 10000);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:30:27,905 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:30:27,905 INFO L273 TraceCheckUtils]: 167: Hoare triple {23935#true} assume !(~i~0 < 10000); {23935#true} is VALID [2018-11-23 12:30:27,905 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:30:27,905 INFO L273 TraceCheckUtils]: 169: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:30:27,905 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23935#true} {23936#false} #74#return; {23936#false} is VALID [2018-11-23 12:30:27,905 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:30:27,905 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:30:27,906 INFO L273 TraceCheckUtils]: 173: Hoare triple {23936#false} assume !false; {23936#false} is VALID [2018-11-23 12:30:27,919 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:30:27,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:27,920 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:30:27,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:28,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:28,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {23935#true} call ULTIMATE.init(); {23935#true} is VALID [2018-11-23 12:30:28,370 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:30:28,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {23935#true} assume true; {23935#true} is VALID [2018-11-23 12:30:28,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23935#true} {23935#true} #66#return; {23935#true} is VALID [2018-11-23 12:30:28,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {23935#true} call #t~ret13 := main(); {23935#true} is VALID [2018-11-23 12:30:28,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {23935#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:28,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {23988#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:28,372 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:30:28,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {23938#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:28,373 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:30:28,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {23939#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:28,374 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:30:28,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {23940#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:28,375 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:30:28,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {23941#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:28,376 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:30:28,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {23942#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:28,377 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:30:28,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {23943#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:28,378 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:30:28,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {23944#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:28,379 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:30:28,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {23945#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:28,381 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:30:28,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {23946#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:28,382 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:30:28,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {23947#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:28,383 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:30:28,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {23948#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:28,384 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:30:28,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {23949#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:28,385 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:30:28,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {23950#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:28,386 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:30:28,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {23951#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:28,388 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:30:28,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {23952#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:28,389 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:30:28,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {23953#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:28,390 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:30:28,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {23954#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:28,391 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:30:28,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {23955#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:28,392 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:30:28,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {23956#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:28,393 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:30:28,394 INFO L273 TraceCheckUtils]: 46: Hoare triple {23957#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:28,394 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:30:28,395 INFO L273 TraceCheckUtils]: 48: Hoare triple {23958#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:28,396 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:30:28,396 INFO L273 TraceCheckUtils]: 50: Hoare triple {23959#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:28,397 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:30:28,397 INFO L273 TraceCheckUtils]: 52: Hoare triple {23960#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:28,398 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:30:28,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {23961#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:28,399 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:30:28,400 INFO L273 TraceCheckUtils]: 56: Hoare triple {23962#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:28,400 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:30:28,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {23963#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:28,401 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:30:28,402 INFO L273 TraceCheckUtils]: 60: Hoare triple {23964#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:28,403 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:30:28,403 INFO L273 TraceCheckUtils]: 62: Hoare triple {23965#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:28,404 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:30:28,404 INFO L273 TraceCheckUtils]: 64: Hoare triple {23966#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:28,405 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:30:28,405 INFO L273 TraceCheckUtils]: 66: Hoare triple {23967#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:28,406 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:30:28,407 INFO L273 TraceCheckUtils]: 68: Hoare triple {23968#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:28,407 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:30:28,408 INFO L273 TraceCheckUtils]: 70: Hoare triple {23969#(<= main_~i~1 32)} assume !(~i~1 < 10000); {23936#false} is VALID [2018-11-23 12:30:28,408 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:30:28,408 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:30:28,408 INFO L273 TraceCheckUtils]: 73: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,409 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:30:28,409 INFO L273 TraceCheckUtils]: 75: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,409 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:30:28,409 INFO L273 TraceCheckUtils]: 77: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,409 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:30:28,409 INFO L273 TraceCheckUtils]: 79: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,410 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:30:28,410 INFO L273 TraceCheckUtils]: 81: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,410 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:30:28,410 INFO L273 TraceCheckUtils]: 83: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,410 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:30:28,411 INFO L273 TraceCheckUtils]: 85: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,411 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:30:28,411 INFO L273 TraceCheckUtils]: 87: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,411 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:30:28,411 INFO L273 TraceCheckUtils]: 89: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,411 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:30:28,411 INFO L273 TraceCheckUtils]: 91: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,412 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:30:28,412 INFO L273 TraceCheckUtils]: 93: Hoare triple {23936#false} assume !(~i~0 < 10000); {23936#false} is VALID [2018-11-23 12:30:28,412 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:30:28,412 INFO L273 TraceCheckUtils]: 95: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:30:28,412 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {23936#false} {23936#false} #70#return; {23936#false} is VALID [2018-11-23 12:30:28,412 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:30:28,413 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:30:28,413 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:30:28,413 INFO L273 TraceCheckUtils]: 100: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,413 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:30:28,413 INFO L273 TraceCheckUtils]: 102: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,413 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:30:28,414 INFO L273 TraceCheckUtils]: 104: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,414 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:30:28,414 INFO L273 TraceCheckUtils]: 106: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,414 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:30:28,414 INFO L273 TraceCheckUtils]: 108: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,414 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:30:28,415 INFO L273 TraceCheckUtils]: 110: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,415 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:30:28,415 INFO L273 TraceCheckUtils]: 112: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,415 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:30:28,415 INFO L273 TraceCheckUtils]: 114: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,415 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:30:28,415 INFO L273 TraceCheckUtils]: 116: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,416 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:30:28,416 INFO L273 TraceCheckUtils]: 118: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,416 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:30:28,416 INFO L273 TraceCheckUtils]: 120: Hoare triple {23936#false} assume !(~i~0 < 10000); {23936#false} is VALID [2018-11-23 12:30:28,416 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:30:28,416 INFO L273 TraceCheckUtils]: 122: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:30:28,416 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {23936#false} {23936#false} #72#return; {23936#false} is VALID [2018-11-23 12:30:28,417 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:30:28,417 INFO L273 TraceCheckUtils]: 125: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,417 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:30:28,417 INFO L273 TraceCheckUtils]: 127: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,417 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:30:28,417 INFO L273 TraceCheckUtils]: 129: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,417 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:30:28,418 INFO L273 TraceCheckUtils]: 131: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,418 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:30:28,418 INFO L273 TraceCheckUtils]: 133: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,418 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:30:28,418 INFO L273 TraceCheckUtils]: 135: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,418 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:30:28,418 INFO L273 TraceCheckUtils]: 137: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,419 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:30:28,419 INFO L273 TraceCheckUtils]: 139: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,419 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:30:28,419 INFO L273 TraceCheckUtils]: 141: Hoare triple {23936#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:28,419 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:30:28,419 INFO L273 TraceCheckUtils]: 143: Hoare triple {23936#false} assume !(~i~2 < 9999); {23936#false} is VALID [2018-11-23 12:30:28,419 INFO L273 TraceCheckUtils]: 144: Hoare triple {23936#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23936#false} is VALID [2018-11-23 12:30:28,420 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:30:28,420 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:30:28,420 INFO L273 TraceCheckUtils]: 147: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,420 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:30:28,420 INFO L273 TraceCheckUtils]: 149: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,420 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:30:28,420 INFO L273 TraceCheckUtils]: 151: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,421 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:30:28,421 INFO L273 TraceCheckUtils]: 153: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,421 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:30:28,421 INFO L273 TraceCheckUtils]: 155: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,421 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:30:28,421 INFO L273 TraceCheckUtils]: 157: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,422 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:30:28,422 INFO L273 TraceCheckUtils]: 159: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,422 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:30:28,422 INFO L273 TraceCheckUtils]: 161: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,422 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:30:28,422 INFO L273 TraceCheckUtils]: 163: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,422 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:30:28,423 INFO L273 TraceCheckUtils]: 165: Hoare triple {23936#false} assume !!(~i~0 < 10000);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:30:28,423 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:30:28,423 INFO L273 TraceCheckUtils]: 167: Hoare triple {23936#false} assume !(~i~0 < 10000); {23936#false} is VALID [2018-11-23 12:30:28,423 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:30:28,423 INFO L273 TraceCheckUtils]: 169: Hoare triple {23936#false} assume true; {23936#false} is VALID [2018-11-23 12:30:28,423 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {23936#false} {23936#false} #74#return; {23936#false} is VALID [2018-11-23 12:30:28,423 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:30:28,424 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:30:28,424 INFO L273 TraceCheckUtils]: 173: Hoare triple {23936#false} assume !false; {23936#false} is VALID [2018-11-23 12:30:28,442 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:30:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:30:28,469 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:30:28,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:28,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:30:28,585 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:30:28,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:30:28,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:30:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:30:28,586 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:30:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:29,574 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:30:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:30:29,574 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:30:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:30:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:30:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:30:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:30:29,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:30:29,729 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:30:29,732 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:30:29,732 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:30:29,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:30:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:30:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:30:29,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:29,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:29,790 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:29,790 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:29,792 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:30:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:30:29,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:29,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:29,793 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:30:29,793 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:30:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:29,795 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:30:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:30:29,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:29,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:29,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:29,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:30:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:30:29,798 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:30:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:29,798 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:30:29,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:30:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:30:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:30:29,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:29,800 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:30:29,800 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:29,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 32 times [2018-11-23 12:30:29,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:30,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {25208#true} call ULTIMATE.init(); {25208#true} is VALID [2018-11-23 12:30:30,617 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:30:30,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:30:30,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25208#true} {25208#true} #66#return; {25208#true} is VALID [2018-11-23 12:30:30,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {25208#true} call #t~ret13 := main(); {25208#true} is VALID [2018-11-23 12:30:30,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {25208#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:30,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {25210#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:30,618 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:30:30,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {25211#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:30,619 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:30:30,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {25212#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:30,620 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:30:30,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {25213#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:30,621 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:30:30,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {25214#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:30,623 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:30:30,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {25215#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:30,624 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:30:30,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {25216#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:30,625 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:30:30,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {25217#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:30,626 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:30:30,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {25218#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:30,627 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:30:30,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {25219#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:30,629 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:30:30,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {25220#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:30,630 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:30:30,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {25221#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:30,631 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:30:30,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {25222#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:30,632 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:30:30,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {25223#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:30,633 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:30:30,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {25224#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:30,635 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:30:30,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {25225#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:30,636 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:30:30,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {25226#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:30,637 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:30:30,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {25227#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:30,638 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:30:30,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {25228#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:30,639 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:30:30,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {25229#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:30,640 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:30:30,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {25230#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:30,641 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:30:30,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {25231#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:30,643 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:30:30,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {25232#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:30,644 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:30:30,644 INFO L273 TraceCheckUtils]: 52: Hoare triple {25233#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:30,645 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:30:30,645 INFO L273 TraceCheckUtils]: 54: Hoare triple {25234#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:30,646 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:30:30,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {25235#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:30,647 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:30:30,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {25236#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:30,648 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:30:30,649 INFO L273 TraceCheckUtils]: 60: Hoare triple {25237#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:30,650 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:30:30,650 INFO L273 TraceCheckUtils]: 62: Hoare triple {25238#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:30,651 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:30:30,651 INFO L273 TraceCheckUtils]: 64: Hoare triple {25239#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:30,652 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:30:30,652 INFO L273 TraceCheckUtils]: 66: Hoare triple {25240#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:30,653 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:30:30,653 INFO L273 TraceCheckUtils]: 68: Hoare triple {25241#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:30,654 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:30:30,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {25242#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:30:30,655 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:30:30,656 INFO L273 TraceCheckUtils]: 72: Hoare triple {25243#(<= main_~i~1 33)} assume !(~i~1 < 10000); {25209#false} is VALID [2018-11-23 12:30:30,656 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:30:30,656 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:30:30,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,657 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:30:30,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,657 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:30:30,657 INFO L273 TraceCheckUtils]: 79: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,657 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:30:30,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,658 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:30:30,658 INFO L273 TraceCheckUtils]: 83: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,658 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:30:30,658 INFO L273 TraceCheckUtils]: 85: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,658 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:30:30,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,659 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:30:30,659 INFO L273 TraceCheckUtils]: 89: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,659 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:30:30,659 INFO L273 TraceCheckUtils]: 91: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,659 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:30:30,659 INFO L273 TraceCheckUtils]: 93: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,659 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:30:30,659 INFO L273 TraceCheckUtils]: 95: Hoare triple {25208#true} assume !(~i~0 < 10000); {25208#true} is VALID [2018-11-23 12:30:30,659 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:30:30,659 INFO L273 TraceCheckUtils]: 97: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:30:30,660 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25208#true} {25209#false} #70#return; {25209#false} is VALID [2018-11-23 12:30:30,660 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:30:30,660 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:30:30,660 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:30:30,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,660 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:30:30,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,660 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:30:30,660 INFO L273 TraceCheckUtils]: 106: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,660 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:30:30,661 INFO L273 TraceCheckUtils]: 108: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,661 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:30:30,661 INFO L273 TraceCheckUtils]: 110: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,661 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:30:30,661 INFO L273 TraceCheckUtils]: 112: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,661 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:30:30,661 INFO L273 TraceCheckUtils]: 114: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,661 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:30:30,661 INFO L273 TraceCheckUtils]: 116: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,661 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:30:30,662 INFO L273 TraceCheckUtils]: 118: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,662 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:30:30,662 INFO L273 TraceCheckUtils]: 120: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,662 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:30:30,662 INFO L273 TraceCheckUtils]: 122: Hoare triple {25208#true} assume !(~i~0 < 10000); {25208#true} is VALID [2018-11-23 12:30:30,662 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:30:30,662 INFO L273 TraceCheckUtils]: 124: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:30:30,662 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25208#true} {25209#false} #72#return; {25209#false} is VALID [2018-11-23 12:30:30,662 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:30:30,663 INFO L273 TraceCheckUtils]: 127: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,663 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:30:30,663 INFO L273 TraceCheckUtils]: 129: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,663 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:30:30,663 INFO L273 TraceCheckUtils]: 131: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,663 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:30:30,663 INFO L273 TraceCheckUtils]: 133: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,663 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:30:30,663 INFO L273 TraceCheckUtils]: 135: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,663 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:30:30,664 INFO L273 TraceCheckUtils]: 137: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,664 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:30:30,664 INFO L273 TraceCheckUtils]: 139: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,664 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:30:30,664 INFO L273 TraceCheckUtils]: 141: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,664 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:30:30,664 INFO L273 TraceCheckUtils]: 143: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:30,664 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:30:30,664 INFO L273 TraceCheckUtils]: 145: Hoare triple {25209#false} assume !(~i~2 < 9999); {25209#false} is VALID [2018-11-23 12:30:30,664 INFO L273 TraceCheckUtils]: 146: Hoare triple {25209#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:30:30,665 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:30:30,665 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:30:30,665 INFO L273 TraceCheckUtils]: 149: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,665 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:30:30,665 INFO L273 TraceCheckUtils]: 151: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,665 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:30:30,665 INFO L273 TraceCheckUtils]: 153: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,665 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:30:30,665 INFO L273 TraceCheckUtils]: 155: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,665 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:30:30,666 INFO L273 TraceCheckUtils]: 157: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,666 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:30:30,666 INFO L273 TraceCheckUtils]: 159: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,666 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:30:30,666 INFO L273 TraceCheckUtils]: 161: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,666 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:30:30,666 INFO L273 TraceCheckUtils]: 163: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,666 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:30:30,666 INFO L273 TraceCheckUtils]: 165: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,666 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:30:30,667 INFO L273 TraceCheckUtils]: 167: Hoare triple {25208#true} assume !!(~i~0 < 10000);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:30:30,667 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:30:30,667 INFO L273 TraceCheckUtils]: 169: Hoare triple {25208#true} assume !(~i~0 < 10000); {25208#true} is VALID [2018-11-23 12:30:30,667 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:30:30,667 INFO L273 TraceCheckUtils]: 171: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:30:30,667 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25208#true} {25209#false} #74#return; {25209#false} is VALID [2018-11-23 12:30:30,667 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:30:30,667 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:30:30,667 INFO L273 TraceCheckUtils]: 175: Hoare triple {25209#false} assume !false; {25209#false} is VALID [2018-11-23 12:30:30,682 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:30:30,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:30,682 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:30:30,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:30,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:30,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:30,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:31,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {25208#true} call ULTIMATE.init(); {25208#true} is VALID [2018-11-23 12:30:31,089 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:30:31,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {25208#true} assume true; {25208#true} is VALID [2018-11-23 12:30:31,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25208#true} {25208#true} #66#return; {25208#true} is VALID [2018-11-23 12:30:31,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {25208#true} call #t~ret13 := main(); {25208#true} is VALID [2018-11-23 12:30:31,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {25208#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:31,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {25262#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:31,091 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:30:31,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {25211#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:31,092 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:30:31,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {25212#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:31,092 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:30:31,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {25213#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:31,093 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:30:31,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {25214#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:31,095 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:30:31,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {25215#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:31,096 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:30:31,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {25216#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:31,097 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:30:31,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {25217#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:31,098 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:30:31,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {25218#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:31,099 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:30:31,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {25219#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:31,100 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:30:31,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {25220#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:31,102 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:30:31,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {25221#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:31,103 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:30:31,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {25222#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:31,104 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:30:31,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {25223#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:31,105 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:30:31,105 INFO L273 TraceCheckUtils]: 34: Hoare triple {25224#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:31,106 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:30:31,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {25225#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:31,107 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:30:31,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {25226#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:31,108 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:30:31,109 INFO L273 TraceCheckUtils]: 40: Hoare triple {25227#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:31,110 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:30:31,110 INFO L273 TraceCheckUtils]: 42: Hoare triple {25228#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:31,111 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:30:31,111 INFO L273 TraceCheckUtils]: 44: Hoare triple {25229#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:31,112 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:30:31,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {25230#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:31,113 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:30:31,114 INFO L273 TraceCheckUtils]: 48: Hoare triple {25231#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:31,114 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:30:31,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {25232#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:31,115 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:30:31,116 INFO L273 TraceCheckUtils]: 52: Hoare triple {25233#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:31,117 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:30:31,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {25234#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:31,118 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:30:31,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {25235#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:31,119 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:30:31,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {25236#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:31,120 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:30:31,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {25237#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:31,121 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:30:31,122 INFO L273 TraceCheckUtils]: 62: Hoare triple {25238#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:31,122 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:30:31,123 INFO L273 TraceCheckUtils]: 64: Hoare triple {25239#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:31,123 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:30:31,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {25240#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:31,125 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:30:31,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {25241#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:31,126 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:30:31,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {25242#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:30:31,127 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:30:31,128 INFO L273 TraceCheckUtils]: 72: Hoare triple {25243#(<= main_~i~1 33)} assume !(~i~1 < 10000); {25209#false} is VALID [2018-11-23 12:30:31,128 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:30:31,128 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:30:31,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,128 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:30:31,128 INFO L273 TraceCheckUtils]: 77: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,129 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:30:31,129 INFO L273 TraceCheckUtils]: 79: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,129 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:30:31,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,129 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:30:31,129 INFO L273 TraceCheckUtils]: 83: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,130 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:30:31,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,130 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:30:31,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,130 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:30:31,130 INFO L273 TraceCheckUtils]: 89: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,131 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:30:31,131 INFO L273 TraceCheckUtils]: 91: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,131 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:30:31,131 INFO L273 TraceCheckUtils]: 93: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,131 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:30:31,131 INFO L273 TraceCheckUtils]: 95: Hoare triple {25209#false} assume !(~i~0 < 10000); {25209#false} is VALID [2018-11-23 12:30:31,131 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:30:31,131 INFO L273 TraceCheckUtils]: 97: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:30:31,131 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {25209#false} {25209#false} #70#return; {25209#false} is VALID [2018-11-23 12:30:31,131 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:30:31,132 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:30:31,132 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:30:31,132 INFO L273 TraceCheckUtils]: 102: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,132 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:30:31,132 INFO L273 TraceCheckUtils]: 104: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,132 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:30:31,132 INFO L273 TraceCheckUtils]: 106: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,132 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:30:31,132 INFO L273 TraceCheckUtils]: 108: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,133 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:30:31,133 INFO L273 TraceCheckUtils]: 110: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,133 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:30:31,133 INFO L273 TraceCheckUtils]: 112: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,133 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:30:31,133 INFO L273 TraceCheckUtils]: 114: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,133 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:30:31,133 INFO L273 TraceCheckUtils]: 116: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,133 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:30:31,133 INFO L273 TraceCheckUtils]: 118: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,134 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:30:31,134 INFO L273 TraceCheckUtils]: 120: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,134 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:30:31,134 INFO L273 TraceCheckUtils]: 122: Hoare triple {25209#false} assume !(~i~0 < 10000); {25209#false} is VALID [2018-11-23 12:30:31,134 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:30:31,134 INFO L273 TraceCheckUtils]: 124: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:30:31,134 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {25209#false} {25209#false} #72#return; {25209#false} is VALID [2018-11-23 12:30:31,134 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:30:31,134 INFO L273 TraceCheckUtils]: 127: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,134 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:30:31,135 INFO L273 TraceCheckUtils]: 129: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,135 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:30:31,135 INFO L273 TraceCheckUtils]: 131: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,135 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:30:31,135 INFO L273 TraceCheckUtils]: 133: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,135 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:30:31,135 INFO L273 TraceCheckUtils]: 135: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,135 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:30:31,135 INFO L273 TraceCheckUtils]: 137: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,135 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:30:31,136 INFO L273 TraceCheckUtils]: 139: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,136 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:30:31,136 INFO L273 TraceCheckUtils]: 141: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,136 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:30:31,136 INFO L273 TraceCheckUtils]: 143: Hoare triple {25209#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:31,136 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:30:31,136 INFO L273 TraceCheckUtils]: 145: Hoare triple {25209#false} assume !(~i~2 < 9999); {25209#false} is VALID [2018-11-23 12:30:31,136 INFO L273 TraceCheckUtils]: 146: Hoare triple {25209#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {25209#false} is VALID [2018-11-23 12:30:31,136 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:30:31,137 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:30:31,137 INFO L273 TraceCheckUtils]: 149: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,137 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:30:31,137 INFO L273 TraceCheckUtils]: 151: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,137 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:30:31,137 INFO L273 TraceCheckUtils]: 153: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,137 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:30:31,137 INFO L273 TraceCheckUtils]: 155: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,137 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:30:31,137 INFO L273 TraceCheckUtils]: 157: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,138 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:30:31,138 INFO L273 TraceCheckUtils]: 159: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,138 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:30:31,138 INFO L273 TraceCheckUtils]: 161: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,138 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:30:31,138 INFO L273 TraceCheckUtils]: 163: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,138 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:30:31,138 INFO L273 TraceCheckUtils]: 165: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,138 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:30:31,138 INFO L273 TraceCheckUtils]: 167: Hoare triple {25209#false} assume !!(~i~0 < 10000);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:30:31,139 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:30:31,139 INFO L273 TraceCheckUtils]: 169: Hoare triple {25209#false} assume !(~i~0 < 10000); {25209#false} is VALID [2018-11-23 12:30:31,139 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:30:31,139 INFO L273 TraceCheckUtils]: 171: Hoare triple {25209#false} assume true; {25209#false} is VALID [2018-11-23 12:30:31,139 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {25209#false} {25209#false} #74#return; {25209#false} is VALID [2018-11-23 12:30:31,139 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:30:31,139 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:30:31,139 INFO L273 TraceCheckUtils]: 175: Hoare triple {25209#false} assume !false; {25209#false} is VALID [2018-11-23 12:30:31,154 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:30:31,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:31,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:30:31,173 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:30:31,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:31,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:30:31,278 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:30:31,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:30:31,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:30:31,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:30:31,280 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2018-11-23 12:30:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,163 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-11-23 12:30:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:30:32,164 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2018-11-23 12:30:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:30:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:30:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:30:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-11-23 12:30:32,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 120 transitions. [2018-11-23 12:30:32,331 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:30:32,333 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:30:32,333 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:30:32,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:30:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:30:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-23 12:30:32,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:32,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 129 states. [2018-11-23 12:30:32,490 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 129 states. [2018-11-23 12:30:32,490 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 129 states. [2018-11-23 12:30:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,492 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:30:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:30:32,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:32,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:32,492 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 130 states. [2018-11-23 12:30:32,492 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 130 states. [2018-11-23 12:30:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,496 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:30:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-23 12:30:32,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:32,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:32,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:32,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:30:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-23 12:30:32,499 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2018-11-23 12:30:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:32,499 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-23 12:30:32,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:30:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-23 12:30:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 12:30:32,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:32,501 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:30:32,501 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:32,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1003169303, now seen corresponding path program 33 times [2018-11-23 12:30:32,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:32,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:33,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:30:33,301 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:30:33,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:33,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #66#return; {26498#true} is VALID [2018-11-23 12:30:33,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret13 := main(); {26498#true} is VALID [2018-11-23 12:30:33,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:33,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {26500#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:33,303 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:30:33,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {26501#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:33,304 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:30:33,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {26502#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:33,305 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:30:33,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {26503#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:33,306 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:30:33,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {26504#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:33,307 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:30:33,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {26505#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:33,308 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:30:33,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {26506#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:33,310 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:30:33,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {26507#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:33,311 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:30:33,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {26508#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:33,312 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:30:33,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {26509#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:33,313 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:30:33,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {26510#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:33,314 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:30:33,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {26511#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:33,315 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:30:33,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {26512#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:33,316 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:30:33,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {26513#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:33,318 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:30:33,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {26514#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:33,319 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:30:33,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {26515#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:33,320 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:30:33,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {26516#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:33,321 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:30:33,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {26517#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:33,322 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:30:33,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {26518#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:33,323 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:30:33,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {26519#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:33,325 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:30:33,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {26520#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:33,326 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:30:33,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {26521#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:33,327 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:30:33,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {26522#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:33,328 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:30:33,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {26523#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:33,329 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:30:33,330 INFO L273 TraceCheckUtils]: 54: Hoare triple {26524#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:33,330 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:30:33,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {26525#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:33,331 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:30:33,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {26526#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:33,333 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:30:33,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {26527#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:33,334 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:30:33,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {26528#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:33,335 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:30:33,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {26529#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:33,336 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:30:33,337 INFO L273 TraceCheckUtils]: 66: Hoare triple {26530#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:33,337 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:30:33,338 INFO L273 TraceCheckUtils]: 68: Hoare triple {26531#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:33,338 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:30:33,339 INFO L273 TraceCheckUtils]: 70: Hoare triple {26532#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:30:33,339 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:30:33,340 INFO L273 TraceCheckUtils]: 72: Hoare triple {26533#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -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:30:33,341 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:30:33,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {26534#(<= main_~i~1 34)} assume !(~i~1 < 10000); {26499#false} is VALID [2018-11-23 12:30:33,341 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:30:33,342 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:30:33,342 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,342 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:30:33,342 INFO L273 TraceCheckUtils]: 79: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,342 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:30:33,342 INFO L273 TraceCheckUtils]: 81: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,343 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:30:33,343 INFO L273 TraceCheckUtils]: 83: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,343 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:30:33,343 INFO L273 TraceCheckUtils]: 85: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,343 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:30:33,343 INFO L273 TraceCheckUtils]: 87: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,344 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:30:33,344 INFO L273 TraceCheckUtils]: 89: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,344 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:30:33,344 INFO L273 TraceCheckUtils]: 91: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,344 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:30:33,344 INFO L273 TraceCheckUtils]: 93: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,344 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:30:33,344 INFO L273 TraceCheckUtils]: 95: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,344 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:30:33,345 INFO L273 TraceCheckUtils]: 97: Hoare triple {26498#true} assume !(~i~0 < 10000); {26498#true} is VALID [2018-11-23 12:30:33,345 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:30:33,345 INFO L273 TraceCheckUtils]: 99: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:33,345 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26498#true} {26499#false} #70#return; {26499#false} is VALID [2018-11-23 12:30:33,345 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:30:33,345 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:30:33,345 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:30:33,345 INFO L273 TraceCheckUtils]: 104: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,345 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:30:33,345 INFO L273 TraceCheckUtils]: 106: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,346 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:30:33,346 INFO L273 TraceCheckUtils]: 108: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,346 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:30:33,346 INFO L273 TraceCheckUtils]: 110: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,346 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:30:33,346 INFO L273 TraceCheckUtils]: 112: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,346 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:30:33,346 INFO L273 TraceCheckUtils]: 114: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,346 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:30:33,346 INFO L273 TraceCheckUtils]: 116: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,347 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:30:33,347 INFO L273 TraceCheckUtils]: 118: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,347 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:30:33,347 INFO L273 TraceCheckUtils]: 120: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,347 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:30:33,347 INFO L273 TraceCheckUtils]: 122: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,347 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:30:33,347 INFO L273 TraceCheckUtils]: 124: Hoare triple {26498#true} assume !(~i~0 < 10000); {26498#true} is VALID [2018-11-23 12:30:33,347 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:30:33,347 INFO L273 TraceCheckUtils]: 126: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:33,348 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26498#true} {26499#false} #72#return; {26499#false} is VALID [2018-11-23 12:30:33,348 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:30:33,348 INFO L273 TraceCheckUtils]: 129: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,348 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:30:33,348 INFO L273 TraceCheckUtils]: 131: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,348 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:30:33,348 INFO L273 TraceCheckUtils]: 133: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,348 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:30:33,348 INFO L273 TraceCheckUtils]: 135: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,349 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:30:33,349 INFO L273 TraceCheckUtils]: 137: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,349 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:30:33,349 INFO L273 TraceCheckUtils]: 139: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,349 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:30:33,349 INFO L273 TraceCheckUtils]: 141: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,349 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:30:33,349 INFO L273 TraceCheckUtils]: 143: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,349 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:30:33,349 INFO L273 TraceCheckUtils]: 145: Hoare triple {26499#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:33,350 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:30:33,350 INFO L273 TraceCheckUtils]: 147: Hoare triple {26499#false} assume !(~i~2 < 9999); {26499#false} is VALID [2018-11-23 12:30:33,350 INFO L273 TraceCheckUtils]: 148: Hoare triple {26499#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26499#false} is VALID [2018-11-23 12:30:33,350 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:30:33,350 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:30:33,350 INFO L273 TraceCheckUtils]: 151: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,350 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:30:33,350 INFO L273 TraceCheckUtils]: 153: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,350 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:30:33,350 INFO L273 TraceCheckUtils]: 155: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,351 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:30:33,351 INFO L273 TraceCheckUtils]: 157: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,351 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:30:33,351 INFO L273 TraceCheckUtils]: 159: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,351 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:30:33,351 INFO L273 TraceCheckUtils]: 161: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,351 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:30:33,351 INFO L273 TraceCheckUtils]: 163: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,351 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:30:33,351 INFO L273 TraceCheckUtils]: 165: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,352 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:30:33,352 INFO L273 TraceCheckUtils]: 167: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,352 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:30:33,352 INFO L273 TraceCheckUtils]: 169: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:33,352 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:30:33,352 INFO L273 TraceCheckUtils]: 171: Hoare triple {26498#true} assume !(~i~0 < 10000); {26498#true} is VALID [2018-11-23 12:30:33,352 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:30:33,352 INFO L273 TraceCheckUtils]: 173: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:33,352 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26498#true} {26499#false} #74#return; {26499#false} is VALID [2018-11-23 12:30:33,352 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:30:33,353 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:30:33,353 INFO L273 TraceCheckUtils]: 177: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:30:33,368 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:30:33,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:33,368 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:30:33,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:30:33,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:30:33,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:33,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:34,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:30:34,219 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:30:34,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:34,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #66#return; {26498#true} is VALID [2018-11-23 12:30:34,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret13 := main(); {26498#true} is VALID [2018-11-23 12:30:34,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26498#true} is VALID [2018-11-23 12:30:34,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,220 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:30:34,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,221 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:30:34,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,221 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:30:34,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,221 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:30:34,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,221 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:30:34,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,222 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:30:34,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,222 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:30:34,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,222 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:30:34,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,222 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:30:34,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,222 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:30:34,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,223 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:30:34,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,223 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:30:34,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,223 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:30:34,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,223 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:30:34,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,223 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:30:34,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,224 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:30:34,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,224 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:30:34,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,224 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:30:34,224 INFO L273 TraceCheckUtils]: 42: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,224 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:30:34,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,224 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:30:34,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,225 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:30:34,225 INFO L273 TraceCheckUtils]: 48: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,225 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:30:34,225 INFO L273 TraceCheckUtils]: 50: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,225 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:30:34,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,225 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:30:34,225 INFO L273 TraceCheckUtils]: 54: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,226 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:30:34,226 INFO L273 TraceCheckUtils]: 56: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,226 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:30:34,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,226 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:30:34,226 INFO L273 TraceCheckUtils]: 60: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,226 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:30:34,226 INFO L273 TraceCheckUtils]: 62: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,226 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:30:34,226 INFO L273 TraceCheckUtils]: 64: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,227 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:30:34,227 INFO L273 TraceCheckUtils]: 66: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,227 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:30:34,227 INFO L273 TraceCheckUtils]: 68: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,227 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:30:34,227 INFO L273 TraceCheckUtils]: 70: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,227 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:30:34,227 INFO L273 TraceCheckUtils]: 72: Hoare triple {26498#true} assume !!(~i~1 < 10000);assume -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:30:34,227 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:30:34,227 INFO L273 TraceCheckUtils]: 74: Hoare triple {26498#true} assume !(~i~1 < 10000); {26498#true} is VALID [2018-11-23 12:30:34,228 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:30:34,228 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:30:34,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,228 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:30:34,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,228 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:30:34,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,228 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:30:34,228 INFO L273 TraceCheckUtils]: 83: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,228 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:30:34,229 INFO L273 TraceCheckUtils]: 85: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,229 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:30:34,229 INFO L273 TraceCheckUtils]: 87: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,229 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:30:34,229 INFO L273 TraceCheckUtils]: 89: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,229 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:30:34,229 INFO L273 TraceCheckUtils]: 91: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,229 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:30:34,229 INFO L273 TraceCheckUtils]: 93: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,229 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:30:34,230 INFO L273 TraceCheckUtils]: 95: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,230 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:30:34,230 INFO L273 TraceCheckUtils]: 97: Hoare triple {26498#true} assume !(~i~0 < 10000); {26498#true} is VALID [2018-11-23 12:30:34,230 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:30:34,230 INFO L273 TraceCheckUtils]: 99: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:34,230 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {26498#true} {26498#true} #70#return; {26498#true} is VALID [2018-11-23 12:30:34,230 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:30:34,230 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:30:34,230 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:30:34,230 INFO L273 TraceCheckUtils]: 104: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,231 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:30:34,231 INFO L273 TraceCheckUtils]: 106: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,231 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:30:34,231 INFO L273 TraceCheckUtils]: 108: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,231 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:30:34,231 INFO L273 TraceCheckUtils]: 110: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,231 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:30:34,231 INFO L273 TraceCheckUtils]: 112: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,231 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:30:34,232 INFO L273 TraceCheckUtils]: 114: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,232 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:30:34,232 INFO L273 TraceCheckUtils]: 116: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,232 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:30:34,232 INFO L273 TraceCheckUtils]: 118: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,232 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:30:34,232 INFO L273 TraceCheckUtils]: 120: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,232 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:30:34,232 INFO L273 TraceCheckUtils]: 122: Hoare triple {26498#true} assume !!(~i~0 < 10000);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:30:34,232 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:30:34,233 INFO L273 TraceCheckUtils]: 124: Hoare triple {26498#true} assume !(~i~0 < 10000); {26498#true} is VALID [2018-11-23 12:30:34,233 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:30:34,233 INFO L273 TraceCheckUtils]: 126: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:30:34,233 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {26498#true} {26498#true} #72#return; {26498#true} is VALID [2018-11-23 12:30:34,233 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:30:34,233 INFO L273 TraceCheckUtils]: 129: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,233 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:30:34,233 INFO L273 TraceCheckUtils]: 131: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,233 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:30:34,233 INFO L273 TraceCheckUtils]: 133: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,234 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:30:34,234 INFO L273 TraceCheckUtils]: 135: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,234 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:30:34,234 INFO L273 TraceCheckUtils]: 137: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,234 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:30:34,234 INFO L273 TraceCheckUtils]: 139: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,234 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:30:34,234 INFO L273 TraceCheckUtils]: 141: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,234 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:30:34,234 INFO L273 TraceCheckUtils]: 143: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,235 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:30:34,235 INFO L273 TraceCheckUtils]: 145: Hoare triple {26498#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:34,235 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:30:34,235 INFO L273 TraceCheckUtils]: 147: Hoare triple {26498#true} assume !(~i~2 < 9999); {26498#true} is VALID [2018-11-23 12:30:34,235 INFO L273 TraceCheckUtils]: 148: Hoare triple {26498#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26498#true} is VALID [2018-11-23 12:30:34,235 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:30:34,236 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:30:34,236 INFO L273 TraceCheckUtils]: 151: Hoare triple {26988#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:30:34,236 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:30:34,237 INFO L273 TraceCheckUtils]: 153: Hoare triple {26995#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:30:34,237 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:30:34,237 INFO L273 TraceCheckUtils]: 155: Hoare triple {27002#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:30:34,238 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:30:34,238 INFO L273 TraceCheckUtils]: 157: Hoare triple {27009#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:30:34,239 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:30:34,239 INFO L273 TraceCheckUtils]: 159: Hoare triple {27016#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:30:34,240 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:30:34,240 INFO L273 TraceCheckUtils]: 161: Hoare triple {27023#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:30:34,241 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:30:34,241 INFO L273 TraceCheckUtils]: 163: Hoare triple {27030#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:30:34,242 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:30:34,242 INFO L273 TraceCheckUtils]: 165: Hoare triple {27037#(<= xor_~i~0 8)} assume !!(~i~0 < 10000);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:30:34,243 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:30:34,244 INFO L273 TraceCheckUtils]: 167: Hoare triple {27044#(<= xor_~i~0 9)} assume !!(~i~0 < 10000);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:30:34,244 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:30:34,245 INFO L273 TraceCheckUtils]: 169: Hoare triple {27051#(<= xor_~i~0 10)} assume !!(~i~0 < 10000);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:30:34,245 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:30:34,246 INFO L273 TraceCheckUtils]: 171: Hoare triple {27058#(<= xor_~i~0 11)} assume !(~i~0 < 10000); {26499#false} is VALID [2018-11-23 12:30:34,246 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:30:34,246 INFO L273 TraceCheckUtils]: 173: Hoare triple {26499#false} assume true; {26499#false} is VALID [2018-11-23 12:30:34,247 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {26499#false} {26498#true} #74#return; {26499#false} is VALID [2018-11-23 12:30:34,247 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:30:34,247 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:30:34,247 INFO L273 TraceCheckUtils]: 177: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:30:34,259 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:30:34,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:34,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:30:34,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:30:34,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:34,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:30:34,406 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:30:34,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:30:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:30:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:30:34,408 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2018-11-23 12:30:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:35,810 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-11-23 12:30:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:30:35,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2018-11-23 12:30:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:30:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:30:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:30:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 148 transitions. [2018-11-23 12:30:35,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 148 transitions. [2018-11-23 12:30:35,946 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:30:35,950 INFO L225 Difference]: With dead ends: 189 [2018-11-23 12:30:35,950 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:30:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:30:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:30:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-23 12:30:36,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:36,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 133 states. [2018-11-23 12:30:36,311 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 133 states. [2018-11-23 12:30:36,311 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 133 states. [2018-11-23 12:30:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:36,313 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:30:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:30:36,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:36,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:36,314 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 135 states. [2018-11-23 12:30:36,314 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 135 states. [2018-11-23 12:30:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:36,317 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-23 12:30:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:30:36,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:36,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:36,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:36,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 12:30:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-11-23 12:30:36,319 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2018-11-23 12:30:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:36,319 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-23 12:30:36,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:30:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:30:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-23 12:30:36,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:36,320 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:30:36,320 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:36,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 457593001, now seen corresponding path program 34 times [2018-11-23 12:30:36,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:36,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:36,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:37,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {27828#true} call ULTIMATE.init(); {27828#true} is VALID [2018-11-23 12:30:37,109 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:30:37,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27828#true} {27828#true} #66#return; {27828#true} is VALID [2018-11-23 12:30:37,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {27828#true} call #t~ret13 := main(); {27828#true} is VALID [2018-11-23 12:30:37,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {27828#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:37,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {27830#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:37,111 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:30:37,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {27831#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:37,113 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:30:37,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {27832#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:37,114 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:30:37,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {27833#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:37,115 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:30:37,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {27834#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:37,116 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:30:37,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {27835#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:37,117 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:30:37,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {27836#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:37,119 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:30:37,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {27837#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:37,120 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:30:37,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {27838#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:37,121 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:30:37,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {27839#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:37,122 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:30:37,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {27840#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:37,123 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:30:37,124 INFO L273 TraceCheckUtils]: 28: Hoare triple {27841#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:37,124 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:30:37,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {27842#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:37,125 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:30:37,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {27843#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:37,127 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:30:37,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {27844#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:37,128 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:30:37,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {27845#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:37,129 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:30:37,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {27846#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:37,130 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:30:37,131 INFO L273 TraceCheckUtils]: 40: Hoare triple {27847#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:37,131 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:30:37,132 INFO L273 TraceCheckUtils]: 42: Hoare triple {27848#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:37,132 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:30:37,133 INFO L273 TraceCheckUtils]: 44: Hoare triple {27849#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:37,133 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:30:37,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {27850#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:37,135 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:30:37,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {27851#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:37,136 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:30:37,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {27852#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:37,137 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:30:37,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {27853#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:37,138 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:30:37,139 INFO L273 TraceCheckUtils]: 54: Hoare triple {27854#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:37,139 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:30:37,140 INFO L273 TraceCheckUtils]: 56: Hoare triple {27855#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:37,141 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:30:37,141 INFO L273 TraceCheckUtils]: 58: Hoare triple {27856#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:37,142 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:30:37,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {27857#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:37,143 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:30:37,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {27858#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:37,144 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:30:37,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {27859#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:37,145 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:30:37,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {27860#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:37,147 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:30:37,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {27861#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:37,148 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:30:37,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {27862#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:30:37,149 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:30:37,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {27863#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -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:30:37,150 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:30:37,151 INFO L273 TraceCheckUtils]: 74: Hoare triple {27864#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -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:30:37,151 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:30:37,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {27865#(<= main_~i~1 35)} assume !(~i~1 < 10000); {27829#false} is VALID [2018-11-23 12:30:37,152 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:30:37,152 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:30:37,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,153 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:30:37,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,153 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:30:37,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,153 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:30:37,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,154 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:30:37,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,154 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:30:37,155 INFO L273 TraceCheckUtils]: 89: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,155 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:30:37,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,155 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:30:37,155 INFO L273 TraceCheckUtils]: 93: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,155 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:30:37,155 INFO L273 TraceCheckUtils]: 95: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,156 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:30:37,156 INFO L273 TraceCheckUtils]: 97: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,156 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:30:37,156 INFO L273 TraceCheckUtils]: 99: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,156 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:30:37,156 INFO L273 TraceCheckUtils]: 101: Hoare triple {27828#true} assume !(~i~0 < 10000); {27828#true} is VALID [2018-11-23 12:30:37,156 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:30:37,157 INFO L273 TraceCheckUtils]: 103: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,157 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27828#true} {27829#false} #70#return; {27829#false} is VALID [2018-11-23 12:30:37,157 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:30:37,157 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:30:37,157 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:30:37,157 INFO L273 TraceCheckUtils]: 108: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,157 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:30:37,157 INFO L273 TraceCheckUtils]: 110: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,158 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:30:37,158 INFO L273 TraceCheckUtils]: 112: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,158 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:30:37,158 INFO L273 TraceCheckUtils]: 114: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,158 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:30:37,158 INFO L273 TraceCheckUtils]: 116: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,158 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:30:37,158 INFO L273 TraceCheckUtils]: 118: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,159 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:30:37,159 INFO L273 TraceCheckUtils]: 120: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,159 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:30:37,159 INFO L273 TraceCheckUtils]: 122: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,159 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:30:37,159 INFO L273 TraceCheckUtils]: 124: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,159 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:30:37,159 INFO L273 TraceCheckUtils]: 126: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,159 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:30:37,160 INFO L273 TraceCheckUtils]: 128: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,160 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:30:37,160 INFO L273 TraceCheckUtils]: 130: Hoare triple {27828#true} assume !(~i~0 < 10000); {27828#true} is VALID [2018-11-23 12:30:37,160 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:30:37,160 INFO L273 TraceCheckUtils]: 132: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,160 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27828#true} {27829#false} #72#return; {27829#false} is VALID [2018-11-23 12:30:37,160 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:30:37,160 INFO L273 TraceCheckUtils]: 135: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,160 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:30:37,161 INFO L273 TraceCheckUtils]: 137: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,161 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:30:37,161 INFO L273 TraceCheckUtils]: 139: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,161 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:30:37,161 INFO L273 TraceCheckUtils]: 141: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,161 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:30:37,161 INFO L273 TraceCheckUtils]: 143: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,161 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:30:37,162 INFO L273 TraceCheckUtils]: 145: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,162 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:30:37,162 INFO L273 TraceCheckUtils]: 147: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,162 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:30:37,162 INFO L273 TraceCheckUtils]: 149: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,162 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:30:37,162 INFO L273 TraceCheckUtils]: 151: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,162 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:30:37,163 INFO L273 TraceCheckUtils]: 153: Hoare triple {27829#false} assume !(~i~2 < 9999); {27829#false} is VALID [2018-11-23 12:30:37,163 INFO L273 TraceCheckUtils]: 154: Hoare triple {27829#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27829#false} is VALID [2018-11-23 12:30:37,163 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:30:37,163 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:30:37,163 INFO L273 TraceCheckUtils]: 157: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,163 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:30:37,163 INFO L273 TraceCheckUtils]: 159: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,163 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:30:37,164 INFO L273 TraceCheckUtils]: 161: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,164 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:30:37,164 INFO L273 TraceCheckUtils]: 163: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,164 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:30:37,164 INFO L273 TraceCheckUtils]: 165: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,164 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:30:37,164 INFO L273 TraceCheckUtils]: 167: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,164 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:30:37,164 INFO L273 TraceCheckUtils]: 169: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,164 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:30:37,165 INFO L273 TraceCheckUtils]: 171: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,165 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:30:37,165 INFO L273 TraceCheckUtils]: 173: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,165 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:30:37,165 INFO L273 TraceCheckUtils]: 175: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,165 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:30:37,165 INFO L273 TraceCheckUtils]: 177: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,165 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:30:37,165 INFO L273 TraceCheckUtils]: 179: Hoare triple {27828#true} assume !(~i~0 < 10000); {27828#true} is VALID [2018-11-23 12:30:37,165 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:30:37,166 INFO L273 TraceCheckUtils]: 181: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,166 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27828#true} {27829#false} #74#return; {27829#false} is VALID [2018-11-23 12:30:37,166 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:30:37,166 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:30:37,166 INFO L273 TraceCheckUtils]: 185: Hoare triple {27829#false} assume !false; {27829#false} is VALID [2018-11-23 12:30:37,181 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:30:37,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:37,182 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:30:37,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:30:37,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:30:37,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:37,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:37,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {27828#true} call ULTIMATE.init(); {27828#true} is VALID [2018-11-23 12:30:37,928 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:30:37,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27828#true} {27828#true} #66#return; {27828#true} is VALID [2018-11-23 12:30:37,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {27828#true} call #t~ret13 := main(); {27828#true} is VALID [2018-11-23 12:30:37,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {27828#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27828#true} is VALID [2018-11-23 12:30:37,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,928 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:30:37,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,929 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:30:37,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,929 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:30:37,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,929 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:30:37,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,929 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:30:37,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,929 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:30:37,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,930 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:30:37,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,930 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:30:37,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,930 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:30:37,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,930 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:30:37,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,930 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:30:37,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,931 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:30:37,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,931 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:30:37,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,931 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:30:37,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,931 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:30:37,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,932 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:30:37,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,932 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:30:37,932 INFO L273 TraceCheckUtils]: 40: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,932 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:30:37,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,932 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:30:37,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,932 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:30:37,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,933 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:30:37,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,933 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:30:37,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,933 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:30:37,933 INFO L273 TraceCheckUtils]: 52: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,933 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:30:37,933 INFO L273 TraceCheckUtils]: 54: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,933 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:30:37,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,934 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:30:37,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,934 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:30:37,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,934 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:30:37,934 INFO L273 TraceCheckUtils]: 62: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,934 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:30:37,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,934 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:30:37,934 INFO L273 TraceCheckUtils]: 66: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,935 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:30:37,935 INFO L273 TraceCheckUtils]: 68: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,935 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:30:37,935 INFO L273 TraceCheckUtils]: 70: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,935 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:30:37,935 INFO L273 TraceCheckUtils]: 72: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,935 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:30:37,935 INFO L273 TraceCheckUtils]: 74: Hoare triple {27828#true} assume !!(~i~1 < 10000);assume -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:30:37,935 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:30:37,935 INFO L273 TraceCheckUtils]: 76: Hoare triple {27828#true} assume !(~i~1 < 10000); {27828#true} is VALID [2018-11-23 12:30:37,936 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:30:37,936 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:30:37,936 INFO L273 TraceCheckUtils]: 79: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,936 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:30:37,936 INFO L273 TraceCheckUtils]: 81: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,936 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:30:37,936 INFO L273 TraceCheckUtils]: 83: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,936 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:30:37,936 INFO L273 TraceCheckUtils]: 85: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,936 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:30:37,937 INFO L273 TraceCheckUtils]: 87: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,937 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:30:37,937 INFO L273 TraceCheckUtils]: 89: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,937 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:30:37,937 INFO L273 TraceCheckUtils]: 91: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,937 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:30:37,937 INFO L273 TraceCheckUtils]: 93: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,937 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:30:37,937 INFO L273 TraceCheckUtils]: 95: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,937 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:30:37,938 INFO L273 TraceCheckUtils]: 97: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,938 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:30:37,938 INFO L273 TraceCheckUtils]: 99: Hoare triple {27828#true} assume !!(~i~0 < 10000);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:30:37,938 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:30:37,938 INFO L273 TraceCheckUtils]: 101: Hoare triple {27828#true} assume !(~i~0 < 10000); {27828#true} is VALID [2018-11-23 12:30:37,938 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:30:37,938 INFO L273 TraceCheckUtils]: 103: Hoare triple {27828#true} assume true; {27828#true} is VALID [2018-11-23 12:30:37,938 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {27828#true} {27828#true} #70#return; {27828#true} is VALID [2018-11-23 12:30:37,938 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:30:37,939 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:30:37,939 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:30:37,939 INFO L273 TraceCheckUtils]: 108: Hoare triple {28190#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:30:37,940 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:30:37,940 INFO L273 TraceCheckUtils]: 110: Hoare triple {28197#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:30:37,940 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:30:37,941 INFO L273 TraceCheckUtils]: 112: Hoare triple {28204#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:30:37,941 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:30:37,941 INFO L273 TraceCheckUtils]: 114: Hoare triple {28211#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:30:37,942 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:30:37,942 INFO L273 TraceCheckUtils]: 116: Hoare triple {28218#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:30:37,943 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:30:37,943 INFO L273 TraceCheckUtils]: 118: Hoare triple {28225#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:30:37,943 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:30:37,944 INFO L273 TraceCheckUtils]: 120: Hoare triple {28232#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:30:37,944 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:30:37,945 INFO L273 TraceCheckUtils]: 122: Hoare triple {28239#(<= xor_~i~0 8)} assume !!(~i~0 < 10000);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:30:37,946 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:30:37,946 INFO L273 TraceCheckUtils]: 124: Hoare triple {28246#(<= xor_~i~0 9)} assume !!(~i~0 < 10000);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:30:37,947 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:30:37,947 INFO L273 TraceCheckUtils]: 126: Hoare triple {28253#(<= xor_~i~0 10)} assume !!(~i~0 < 10000);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:30:37,948 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:30:37,948 INFO L273 TraceCheckUtils]: 128: Hoare triple {28260#(<= xor_~i~0 11)} assume !!(~i~0 < 10000);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:30:37,949 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:30:37,950 INFO L273 TraceCheckUtils]: 130: Hoare triple {28267#(<= xor_~i~0 12)} assume !(~i~0 < 10000); {27829#false} is VALID [2018-11-23 12:30:37,950 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:30:37,950 INFO L273 TraceCheckUtils]: 132: Hoare triple {27829#false} assume true; {27829#false} is VALID [2018-11-23 12:30:37,950 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {27829#false} {27828#true} #72#return; {27829#false} is VALID [2018-11-23 12:30:37,950 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:30:37,951 INFO L273 TraceCheckUtils]: 135: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,951 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:30:37,951 INFO L273 TraceCheckUtils]: 137: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,951 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:30:37,951 INFO L273 TraceCheckUtils]: 139: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,951 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:30:37,952 INFO L273 TraceCheckUtils]: 141: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,952 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:30:37,952 INFO L273 TraceCheckUtils]: 143: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,952 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:30:37,952 INFO L273 TraceCheckUtils]: 145: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,952 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:30:37,952 INFO L273 TraceCheckUtils]: 147: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,953 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:30:37,953 INFO L273 TraceCheckUtils]: 149: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,953 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:30:37,953 INFO L273 TraceCheckUtils]: 151: Hoare triple {27829#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:30:37,953 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:30:37,953 INFO L273 TraceCheckUtils]: 153: Hoare triple {27829#false} assume !(~i~2 < 9999); {27829#false} is VALID [2018-11-23 12:30:37,953 INFO L273 TraceCheckUtils]: 154: Hoare triple {27829#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27829#false} is VALID [2018-11-23 12:30:37,953 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:30:37,953 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:30:37,953 INFO L273 TraceCheckUtils]: 157: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,954 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:30:37,954 INFO L273 TraceCheckUtils]: 159: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,954 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:30:37,954 INFO L273 TraceCheckUtils]: 161: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,954 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:30:37,954 INFO L273 TraceCheckUtils]: 163: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,954 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:30:37,954 INFO L273 TraceCheckUtils]: 165: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,954 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:30:37,954 INFO L273 TraceCheckUtils]: 167: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,955 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:30:37,955 INFO L273 TraceCheckUtils]: 169: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,955 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:30:37,955 INFO L273 TraceCheckUtils]: 171: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,955 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:30:37,955 INFO L273 TraceCheckUtils]: 173: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,955 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:30:37,955 INFO L273 TraceCheckUtils]: 175: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,955 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:30:37,955 INFO L273 TraceCheckUtils]: 177: Hoare triple {27829#false} assume !!(~i~0 < 10000);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:30:37,956 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:30:37,956 INFO L273 TraceCheckUtils]: 179: Hoare triple {27829#false} assume !(~i~0 < 10000); {27829#false} is VALID [2018-11-23 12:30:37,956 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:30:37,956 INFO L273 TraceCheckUtils]: 181: Hoare triple {27829#false} assume true; {27829#false} is VALID [2018-11-23 12:30:37,956 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {27829#false} {27829#false} #74#return; {27829#false} is VALID [2018-11-23 12:30:37,956 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:30:37,956 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:30:37,956 INFO L273 TraceCheckUtils]: 185: Hoare triple {27829#false} assume !false; {27829#false} is VALID [2018-11-23 12:30:37,969 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:30:37,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:37,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2018-11-23 12:30:37,988 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:30:37,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:37,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:30:38,118 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:38,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:30:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:30:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:30:38,120 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2018-11-23 12:30:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:39,504 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2018-11-23 12:30:39,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:30:39,505 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2018-11-23 12:30:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:30:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:30:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:30:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2018-11-23 12:30:39,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 152 transitions. [2018-11-23 12:30:39,646 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:30:39,649 INFO L225 Difference]: With dead ends: 195 [2018-11-23 12:30:39,649 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:30:39,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:30:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:30:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-23 12:30:39,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:39,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 137 states. [2018-11-23 12:30:39,708 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 137 states. [2018-11-23 12:30:39,709 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 137 states. [2018-11-23 12:30:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:39,710 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:30:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:30:39,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:39,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:39,711 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 139 states. [2018-11-23 12:30:39,711 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 139 states. [2018-11-23 12:30:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:39,715 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:30:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:30:39,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:39,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:39,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 12:30:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-23 12:30:39,718 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2018-11-23 12:30:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-23 12:30:39,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:30:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:30:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 12:30:39,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:39,720 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:30:39,720 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:39,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1118472855, now seen corresponding path program 35 times [2018-11-23 12:30:39,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:39,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:40,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {29207#true} call ULTIMATE.init(); {29207#true} is VALID [2018-11-23 12:30:40,879 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:40,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:30:40,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29207#true} {29207#true} #66#return; {29207#true} is VALID [2018-11-23 12:30:40,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {29207#true} call #t~ret13 := main(); {29207#true} is VALID [2018-11-23 12:30:40,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {29207#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:30:40,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {29209#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:30:40,881 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:30:40,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {29210#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:30:40,882 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:30:40,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {29211#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:30:40,883 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:30:40,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {29212#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:30:40,885 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:30:40,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {29213#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:30:40,886 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:30:40,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {29214#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:30:40,887 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:30:40,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {29215#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:30:40,888 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:30:40,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {29216#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:30:40,890 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:30:40,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {29217#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:30:40,891 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:30:40,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {29218#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:30:40,892 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:30:40,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {29219#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:30:40,893 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:30:40,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {29220#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:30:40,894 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:30:40,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {29221#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:30:40,895 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:30:40,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {29222#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:30:40,897 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:30:40,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {29223#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:30:40,898 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:30:40,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {29224#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:30:40,899 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:30:40,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {29225#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:30:40,900 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:30:40,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {29226#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:30:40,901 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:30:40,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {29227#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:30:40,902 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:30:40,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {29228#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:30:40,903 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:30:40,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {29229#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:30:40,905 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:30:40,905 INFO L273 TraceCheckUtils]: 48: Hoare triple {29230#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:30:40,906 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:30:40,906 INFO L273 TraceCheckUtils]: 50: Hoare triple {29231#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:30:40,907 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:30:40,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {29232#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:30:40,908 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:30:40,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {29233#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:30:40,910 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:30:40,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {29234#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:30:40,911 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:30:40,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {29235#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:30:40,913 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:30:40,913 INFO L273 TraceCheckUtils]: 60: Hoare triple {29236#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:30:40,914 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:30:40,915 INFO L273 TraceCheckUtils]: 62: Hoare triple {29237#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:30:40,915 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:30:40,916 INFO L273 TraceCheckUtils]: 64: Hoare triple {29238#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:30:40,917 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:30:40,917 INFO L273 TraceCheckUtils]: 66: Hoare triple {29239#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:30:40,918 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:30:40,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {29240#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:30:40,919 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:30:40,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {29241#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:30:40,921 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:30:40,921 INFO L273 TraceCheckUtils]: 72: Hoare triple {29242#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -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:30:40,922 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:30:40,923 INFO L273 TraceCheckUtils]: 74: Hoare triple {29243#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -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:30:40,923 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:30:40,924 INFO L273 TraceCheckUtils]: 76: Hoare triple {29244#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -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:30:40,925 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:30:40,925 INFO L273 TraceCheckUtils]: 78: Hoare triple {29245#(<= main_~i~1 36)} assume !(~i~1 < 10000); {29208#false} is VALID [2018-11-23 12:30:40,926 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:30:40,926 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:30:40,926 INFO L273 TraceCheckUtils]: 81: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,926 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:30:40,927 INFO L273 TraceCheckUtils]: 83: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,927 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:30:40,927 INFO L273 TraceCheckUtils]: 85: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,927 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:30:40,927 INFO L273 TraceCheckUtils]: 87: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,928 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:30:40,928 INFO L273 TraceCheckUtils]: 89: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,928 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:30:40,928 INFO L273 TraceCheckUtils]: 91: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,928 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:30:40,929 INFO L273 TraceCheckUtils]: 93: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,929 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:30:40,929 INFO L273 TraceCheckUtils]: 95: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,929 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:30:40,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,930 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:30:40,930 INFO L273 TraceCheckUtils]: 99: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,930 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:30:40,930 INFO L273 TraceCheckUtils]: 101: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,931 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:30:40,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,931 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:30:40,931 INFO L273 TraceCheckUtils]: 105: Hoare triple {29207#true} assume !(~i~0 < 10000); {29207#true} is VALID [2018-11-23 12:30:40,931 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:30:40,931 INFO L273 TraceCheckUtils]: 107: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:30:40,932 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29207#true} {29208#false} #70#return; {29208#false} is VALID [2018-11-23 12:30:40,932 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:40,932 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:30:40,932 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:30:40,932 INFO L273 TraceCheckUtils]: 112: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,932 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:30:40,932 INFO L273 TraceCheckUtils]: 114: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,933 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:30:40,933 INFO L273 TraceCheckUtils]: 116: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,933 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:30:40,933 INFO L273 TraceCheckUtils]: 118: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,933 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:30:40,933 INFO L273 TraceCheckUtils]: 120: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,933 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:30:40,933 INFO L273 TraceCheckUtils]: 122: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,934 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:30:40,934 INFO L273 TraceCheckUtils]: 124: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,934 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:30:40,934 INFO L273 TraceCheckUtils]: 126: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,934 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:30:40,934 INFO L273 TraceCheckUtils]: 128: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,934 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:30:40,935 INFO L273 TraceCheckUtils]: 130: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,935 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:30:40,935 INFO L273 TraceCheckUtils]: 132: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,935 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:30:40,935 INFO L273 TraceCheckUtils]: 134: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,935 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:30:40,935 INFO L273 TraceCheckUtils]: 136: Hoare triple {29207#true} assume !(~i~0 < 10000); {29207#true} is VALID [2018-11-23 12:30:40,935 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:30:40,936 INFO L273 TraceCheckUtils]: 138: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:30:40,936 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29207#true} {29208#false} #72#return; {29208#false} is VALID [2018-11-23 12:30:40,936 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:40,936 INFO L273 TraceCheckUtils]: 141: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,936 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:40,936 INFO L273 TraceCheckUtils]: 143: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,936 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:40,937 INFO L273 TraceCheckUtils]: 145: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,937 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:40,937 INFO L273 TraceCheckUtils]: 147: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,937 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:40,937 INFO L273 TraceCheckUtils]: 149: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,937 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:40,937 INFO L273 TraceCheckUtils]: 151: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,937 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:40,938 INFO L273 TraceCheckUtils]: 153: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,938 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:40,938 INFO L273 TraceCheckUtils]: 155: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,938 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:40,938 INFO L273 TraceCheckUtils]: 157: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:40,938 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:40,938 INFO L273 TraceCheckUtils]: 159: Hoare triple {29208#false} assume !(~i~2 < 9999); {29208#false} is VALID [2018-11-23 12:30:40,939 INFO L273 TraceCheckUtils]: 160: Hoare triple {29208#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:30:40,939 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:30:40,939 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:30:40,939 INFO L273 TraceCheckUtils]: 163: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,939 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:30:40,939 INFO L273 TraceCheckUtils]: 165: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,939 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:30:40,939 INFO L273 TraceCheckUtils]: 167: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,940 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:30:40,940 INFO L273 TraceCheckUtils]: 169: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,940 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:30:40,940 INFO L273 TraceCheckUtils]: 171: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,940 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:30:40,940 INFO L273 TraceCheckUtils]: 173: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,940 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:30:40,941 INFO L273 TraceCheckUtils]: 175: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,941 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:30:40,941 INFO L273 TraceCheckUtils]: 177: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,941 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:30:40,941 INFO L273 TraceCheckUtils]: 179: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,941 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:30:40,941 INFO L273 TraceCheckUtils]: 181: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,941 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:30:40,942 INFO L273 TraceCheckUtils]: 183: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,942 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:30:40,942 INFO L273 TraceCheckUtils]: 185: Hoare triple {29207#true} assume !!(~i~0 < 10000);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:30:40,942 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:30:40,942 INFO L273 TraceCheckUtils]: 187: Hoare triple {29207#true} assume !(~i~0 < 10000); {29207#true} is VALID [2018-11-23 12:30:40,942 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:30:40,942 INFO L273 TraceCheckUtils]: 189: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:30:40,943 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29207#true} {29208#false} #74#return; {29208#false} is VALID [2018-11-23 12:30:40,943 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:40,943 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:40,943 INFO L273 TraceCheckUtils]: 193: Hoare triple {29208#false} assume !false; {29208#false} is VALID [2018-11-23 12:30:40,978 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:30:40,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:40,979 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:30:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:31:40,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:31:40,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:31:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:40,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:41,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {29207#true} call ULTIMATE.init(); {29207#true} is VALID [2018-11-23 12:31:41,154 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:31:41,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {29207#true} assume true; {29207#true} is VALID [2018-11-23 12:31:41,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29207#true} {29207#true} #66#return; {29207#true} is VALID [2018-11-23 12:31:41,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {29207#true} call #t~ret13 := main(); {29207#true} is VALID [2018-11-23 12:31:41,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {29207#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29207#true} is VALID [2018-11-23 12:31:41,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,155 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:31:41,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,155 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:31:41,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,156 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:31:41,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,156 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:31:41,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,156 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:31:41,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,156 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:31:41,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,157 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:31:41,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,157 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:31:41,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,157 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:31:41,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,157 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:31:41,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,157 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:31:41,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,158 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:31:41,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,158 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:31:41,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,158 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:31:41,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,158 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:31:41,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,158 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:31:41,158 INFO L273 TraceCheckUtils]: 38: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,159 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:31:41,159 INFO L273 TraceCheckUtils]: 40: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,159 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:31:41,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,159 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:31:41,159 INFO L273 TraceCheckUtils]: 44: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,159 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:31:41,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,159 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:31:41,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,160 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:31:41,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,160 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:31:41,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,160 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:31:41,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,160 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:31:41,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,160 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:31:41,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,161 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:31:41,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,161 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:31:41,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,161 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:31:41,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,161 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:31:41,161 INFO L273 TraceCheckUtils]: 66: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,161 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:31:41,162 INFO L273 TraceCheckUtils]: 68: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,162 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:31:41,162 INFO L273 TraceCheckUtils]: 70: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,162 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:31:41,162 INFO L273 TraceCheckUtils]: 72: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,162 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:31:41,162 INFO L273 TraceCheckUtils]: 74: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,162 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:31:41,162 INFO L273 TraceCheckUtils]: 76: Hoare triple {29207#true} assume !!(~i~1 < 10000);assume -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:31:41,162 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:31:41,163 INFO L273 TraceCheckUtils]: 78: Hoare triple {29207#true} assume !(~i~1 < 10000); {29207#true} is VALID [2018-11-23 12:31:41,163 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:31:41,163 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:31:41,163 INFO L273 TraceCheckUtils]: 81: Hoare triple {29489#(<= xor_~i~0 1)} assume !!(~i~0 < 10000);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:31:41,164 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:31:41,164 INFO L273 TraceCheckUtils]: 83: Hoare triple {29496#(<= xor_~i~0 2)} assume !!(~i~0 < 10000);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:31:41,165 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:31:41,165 INFO L273 TraceCheckUtils]: 85: Hoare triple {29503#(<= xor_~i~0 3)} assume !!(~i~0 < 10000);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:31:41,168 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:31:41,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {29510#(<= xor_~i~0 4)} assume !!(~i~0 < 10000);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:31:41,169 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:31:41,169 INFO L273 TraceCheckUtils]: 89: Hoare triple {29517#(<= xor_~i~0 5)} assume !!(~i~0 < 10000);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:31:41,170 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:31:41,170 INFO L273 TraceCheckUtils]: 91: Hoare triple {29524#(<= xor_~i~0 6)} assume !!(~i~0 < 10000);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:31:41,171 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:31:41,171 INFO L273 TraceCheckUtils]: 93: Hoare triple {29531#(<= xor_~i~0 7)} assume !!(~i~0 < 10000);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:31:41,171 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:31:41,172 INFO L273 TraceCheckUtils]: 95: Hoare triple {29538#(<= xor_~i~0 8)} assume !!(~i~0 < 10000);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:31:41,172 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:31:41,172 INFO L273 TraceCheckUtils]: 97: Hoare triple {29545#(<= xor_~i~0 9)} assume !!(~i~0 < 10000);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:31:41,173 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:31:41,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {29552#(<= xor_~i~0 10)} assume !!(~i~0 < 10000);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:31:41,174 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:31:41,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {29559#(<= xor_~i~0 11)} assume !!(~i~0 < 10000);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:31:41,175 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:31:41,175 INFO L273 TraceCheckUtils]: 103: Hoare triple {29566#(<= xor_~i~0 12)} assume !!(~i~0 < 10000);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:31:41,176 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:31:41,177 INFO L273 TraceCheckUtils]: 105: Hoare triple {29573#(<= xor_~i~0 13)} assume !(~i~0 < 10000); {29208#false} is VALID [2018-11-23 12:31:41,177 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:31:41,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:31:41,177 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {29208#false} {29207#true} #70#return; {29208#false} is VALID [2018-11-23 12:31:41,177 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:31:41,178 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:31:41,178 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:31:41,178 INFO L273 TraceCheckUtils]: 112: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,178 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:31:41,178 INFO L273 TraceCheckUtils]: 114: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,178 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:31:41,179 INFO L273 TraceCheckUtils]: 116: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,179 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:31:41,179 INFO L273 TraceCheckUtils]: 118: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,179 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:31:41,179 INFO L273 TraceCheckUtils]: 120: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,179 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:31:41,180 INFO L273 TraceCheckUtils]: 122: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,180 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:31:41,180 INFO L273 TraceCheckUtils]: 124: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,180 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:31:41,180 INFO L273 TraceCheckUtils]: 126: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,180 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:31:41,180 INFO L273 TraceCheckUtils]: 128: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,181 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:31:41,181 INFO L273 TraceCheckUtils]: 130: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,181 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:31:41,181 INFO L273 TraceCheckUtils]: 132: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,181 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:31:41,181 INFO L273 TraceCheckUtils]: 134: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,182 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:31:41,182 INFO L273 TraceCheckUtils]: 136: Hoare triple {29208#false} assume !(~i~0 < 10000); {29208#false} is VALID [2018-11-23 12:31:41,182 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:31:41,182 INFO L273 TraceCheckUtils]: 138: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:31:41,182 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29208#false} {29208#false} #72#return; {29208#false} is VALID [2018-11-23 12:31:41,182 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:31:41,182 INFO L273 TraceCheckUtils]: 141: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,182 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:31:41,183 INFO L273 TraceCheckUtils]: 143: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,183 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:31:41,183 INFO L273 TraceCheckUtils]: 145: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,183 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:31:41,183 INFO L273 TraceCheckUtils]: 147: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,183 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:31:41,183 INFO L273 TraceCheckUtils]: 149: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,183 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:31:41,183 INFO L273 TraceCheckUtils]: 151: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,183 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:31:41,184 INFO L273 TraceCheckUtils]: 153: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,184 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:31:41,184 INFO L273 TraceCheckUtils]: 155: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,184 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:31:41,184 INFO L273 TraceCheckUtils]: 157: Hoare triple {29208#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:41,184 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:31:41,184 INFO L273 TraceCheckUtils]: 159: Hoare triple {29208#false} assume !(~i~2 < 9999); {29208#false} is VALID [2018-11-23 12:31:41,184 INFO L273 TraceCheckUtils]: 160: Hoare triple {29208#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {29208#false} is VALID [2018-11-23 12:31:41,184 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:31:41,184 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:31:41,185 INFO L273 TraceCheckUtils]: 163: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,185 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:31:41,185 INFO L273 TraceCheckUtils]: 165: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,185 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:31:41,185 INFO L273 TraceCheckUtils]: 167: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,185 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:31:41,185 INFO L273 TraceCheckUtils]: 169: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,185 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:31:41,185 INFO L273 TraceCheckUtils]: 171: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,185 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:31:41,186 INFO L273 TraceCheckUtils]: 173: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,186 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:31:41,186 INFO L273 TraceCheckUtils]: 175: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,186 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:31:41,186 INFO L273 TraceCheckUtils]: 177: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,186 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:31:41,186 INFO L273 TraceCheckUtils]: 179: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,186 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:31:41,186 INFO L273 TraceCheckUtils]: 181: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,186 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:31:41,187 INFO L273 TraceCheckUtils]: 183: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,187 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:31:41,187 INFO L273 TraceCheckUtils]: 185: Hoare triple {29208#false} assume !!(~i~0 < 10000);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:31:41,187 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:31:41,187 INFO L273 TraceCheckUtils]: 187: Hoare triple {29208#false} assume !(~i~0 < 10000); {29208#false} is VALID [2018-11-23 12:31:41,187 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:31:41,187 INFO L273 TraceCheckUtils]: 189: Hoare triple {29208#false} assume true; {29208#false} is VALID [2018-11-23 12:31:41,187 INFO L268 TraceCheckUtils]: 190: Hoare quadruple {29208#false} {29208#false} #74#return; {29208#false} is VALID [2018-11-23 12:31:41,187 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:31:41,187 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:31:41,188 INFO L273 TraceCheckUtils]: 193: Hoare triple {29208#false} assume !false; {29208#false} is VALID [2018-11-23 12:31:41,201 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:31:41,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:41,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2018-11-23 12:31:41,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:31:41,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:41,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:31:41,367 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:31:41,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:31:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:31:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:31:41,369 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2018-11-23 12:31:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:42,517 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-11-23 12:31:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:31:42,517 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2018-11-23 12:31:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:31:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:31:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:31:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:31:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 156 transitions. [2018-11-23 12:31:42,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 156 transitions. [2018-11-23 12:31:42,673 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:31:42,676 INFO L225 Difference]: With dead ends: 201 [2018-11-23 12:31:42,676 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:31:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:31:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:31:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 12:31:42,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:31:42,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 12:31:42,753 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 12:31:42,753 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 12:31:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:42,755 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:31:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:31:42,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:42,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:42,756 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 12:31:42,756 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 12:31:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:42,758 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-11-23 12:31:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:31:42,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:42,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:42,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:31:42,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:31:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:31:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-11-23 12:31:42,761 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2018-11-23 12:31:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:31:42,761 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-11-23 12:31:42,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:31:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:31:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:31:42,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:31:42,762 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:31:42,763 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:31:42,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:31:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash 543770665, now seen corresponding path program 36 times [2018-11-23 12:31:42,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:31:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:31:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:42,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:31:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:44,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {30635#true} call ULTIMATE.init(); {30635#true} is VALID [2018-11-23 12:31:44,610 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:31:44,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:31:44,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30635#true} {30635#true} #66#return; {30635#true} is VALID [2018-11-23 12:31:44,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {30635#true} call #t~ret13 := main(); {30635#true} is VALID [2018-11-23 12:31:44,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {30635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);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:31:44,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {30637#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -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:31:44,612 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:31:44,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {30638#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -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:31:44,614 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:31:44,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {30639#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -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:31:44,615 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:31:44,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {30640#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -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:31:44,616 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:31:44,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {30641#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -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:31:44,617 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:31:44,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {30642#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -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:31:44,618 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:31:44,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {30643#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -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:31:44,619 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:31:44,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {30644#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -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:31:44,621 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:31:44,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {30645#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -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:31:44,622 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:31:44,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {30646#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -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:31:44,623 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:31:44,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {30647#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -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:31:44,624 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:31:44,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {30648#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -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:31:44,625 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:31:44,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {30649#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -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:31:44,627 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:31:44,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {30650#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -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:31:44,628 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:31:44,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {30651#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -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:31:44,629 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:31:44,629 INFO L273 TraceCheckUtils]: 36: Hoare triple {30652#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -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:31:44,630 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:31:44,631 INFO L273 TraceCheckUtils]: 38: Hoare triple {30653#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -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:31:44,631 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:31:44,632 INFO L273 TraceCheckUtils]: 40: Hoare triple {30654#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -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:31:44,632 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:31:44,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {30655#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -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:31:44,634 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:31:44,634 INFO L273 TraceCheckUtils]: 44: Hoare triple {30656#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -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:31:44,635 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:31:44,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {30657#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -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:31:44,636 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:31:44,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {30658#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -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:31:44,637 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:31:44,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {30659#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -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:31:44,638 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:31:44,639 INFO L273 TraceCheckUtils]: 52: Hoare triple {30660#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -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:31:44,639 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:31:44,640 INFO L273 TraceCheckUtils]: 54: Hoare triple {30661#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -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:31:44,640 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:31:44,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {30662#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -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:31:44,642 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:31:44,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {30663#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -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:31:44,643 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:31:44,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {30664#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -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:31:44,644 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:31:44,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {30665#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -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:31:44,645 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:31:44,646 INFO L273 TraceCheckUtils]: 64: Hoare triple {30666#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -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:31:44,646 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:31:44,647 INFO L273 TraceCheckUtils]: 66: Hoare triple {30667#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -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:31:44,647 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:31:44,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {30668#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -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:31:44,649 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:31:44,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {30669#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -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:31:44,650 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:31:44,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {30670#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -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:31:44,651 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:31:44,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {30671#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -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:31:44,652 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:31:44,652 INFO L273 TraceCheckUtils]: 76: Hoare triple {30672#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -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:31:44,653 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:31:44,654 INFO L273 TraceCheckUtils]: 78: Hoare triple {30673#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -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:31:44,654 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:31:44,655 INFO L273 TraceCheckUtils]: 80: Hoare triple {30674#(<= main_~i~1 37)} assume !(~i~1 < 10000); {30636#false} is VALID [2018-11-23 12:31:44,655 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:31:44,655 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:31:44,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,656 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:31:44,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,656 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:31:44,656 INFO L273 TraceCheckUtils]: 87: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,656 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:31:44,656 INFO L273 TraceCheckUtils]: 89: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,657 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:31:44,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,657 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:31:44,657 INFO L273 TraceCheckUtils]: 93: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,657 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:31:44,657 INFO L273 TraceCheckUtils]: 95: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,657 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:31:44,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,658 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:31:44,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,658 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:31:44,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,658 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:31:44,658 INFO L273 TraceCheckUtils]: 103: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,658 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:31:44,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,659 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:31:44,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,659 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:31:44,659 INFO L273 TraceCheckUtils]: 109: Hoare triple {30635#true} assume !(~i~0 < 10000); {30635#true} is VALID [2018-11-23 12:31:44,659 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:31:44,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:31:44,659 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {30635#true} {30636#false} #70#return; {30636#false} is VALID [2018-11-23 12:31:44,659 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:31:44,659 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:31:44,659 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:31:44,660 INFO L273 TraceCheckUtils]: 116: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,660 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:31:44,660 INFO L273 TraceCheckUtils]: 118: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,660 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:31:44,660 INFO L273 TraceCheckUtils]: 120: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,660 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:31:44,660 INFO L273 TraceCheckUtils]: 122: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,660 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:31:44,660 INFO L273 TraceCheckUtils]: 124: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,660 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:31:44,661 INFO L273 TraceCheckUtils]: 126: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,661 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:31:44,661 INFO L273 TraceCheckUtils]: 128: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,661 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:31:44,661 INFO L273 TraceCheckUtils]: 130: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,661 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:31:44,661 INFO L273 TraceCheckUtils]: 132: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,661 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:31:44,661 INFO L273 TraceCheckUtils]: 134: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,661 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:31:44,662 INFO L273 TraceCheckUtils]: 136: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,662 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:31:44,662 INFO L273 TraceCheckUtils]: 138: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,662 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:31:44,662 INFO L273 TraceCheckUtils]: 140: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,662 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:31:44,662 INFO L273 TraceCheckUtils]: 142: Hoare triple {30635#true} assume !(~i~0 < 10000); {30635#true} is VALID [2018-11-23 12:31:44,662 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:31:44,662 INFO L273 TraceCheckUtils]: 144: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:31:44,662 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {30635#true} {30636#false} #72#return; {30636#false} is VALID [2018-11-23 12:31:44,663 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:31:44,663 INFO L273 TraceCheckUtils]: 147: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,663 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:31:44,663 INFO L273 TraceCheckUtils]: 149: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,663 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:31:44,663 INFO L273 TraceCheckUtils]: 151: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,663 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:31:44,663 INFO L273 TraceCheckUtils]: 153: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,663 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:31:44,663 INFO L273 TraceCheckUtils]: 155: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,664 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:31:44,664 INFO L273 TraceCheckUtils]: 157: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,664 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:31:44,664 INFO L273 TraceCheckUtils]: 159: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,664 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:31:44,664 INFO L273 TraceCheckUtils]: 161: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,664 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:31:44,664 INFO L273 TraceCheckUtils]: 163: Hoare triple {30636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:31:44,664 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:31:44,664 INFO L273 TraceCheckUtils]: 165: Hoare triple {30636#false} assume !(~i~2 < 9999); {30636#false} is VALID [2018-11-23 12:31:44,665 INFO L273 TraceCheckUtils]: 166: Hoare triple {30636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30636#false} is VALID [2018-11-23 12:31:44,665 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:31:44,665 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:31:44,665 INFO L273 TraceCheckUtils]: 169: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,665 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:31:44,665 INFO L273 TraceCheckUtils]: 171: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,665 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:31:44,665 INFO L273 TraceCheckUtils]: 173: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,665 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:31:44,665 INFO L273 TraceCheckUtils]: 175: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,666 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:31:44,666 INFO L273 TraceCheckUtils]: 177: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,666 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:31:44,666 INFO L273 TraceCheckUtils]: 179: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,666 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:31:44,666 INFO L273 TraceCheckUtils]: 181: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,666 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:31:44,666 INFO L273 TraceCheckUtils]: 183: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,666 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:31:44,666 INFO L273 TraceCheckUtils]: 185: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,667 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:31:44,667 INFO L273 TraceCheckUtils]: 187: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,667 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:31:44,667 INFO L273 TraceCheckUtils]: 189: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,667 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:31:44,667 INFO L273 TraceCheckUtils]: 191: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,667 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:31:44,667 INFO L273 TraceCheckUtils]: 193: Hoare triple {30635#true} assume !!(~i~0 < 10000);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:31:44,667 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:31:44,667 INFO L273 TraceCheckUtils]: 195: Hoare triple {30635#true} assume !(~i~0 < 10000); {30635#true} is VALID [2018-11-23 12:31:44,668 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:31:44,668 INFO L273 TraceCheckUtils]: 197: Hoare triple {30635#true} assume true; {30635#true} is VALID [2018-11-23 12:31:44,668 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {30635#true} {30636#false} #74#return; {30636#false} is VALID [2018-11-23 12:31:44,668 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:31:44,668 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:31:44,668 INFO L273 TraceCheckUtils]: 201: Hoare triple {30636#false} assume !false; {30636#false} is VALID [2018-11-23 12:31:44,686 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:31:44,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:31:44,686 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:31:44,695 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE